/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/recursive-simple/fibo_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:01:31,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:01:31,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:01:31,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:01:31,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:01:31,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:01:31,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:01:31,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:01:31,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:01:31,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:01:31,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:01:31,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:01:31,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:01:31,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:01:31,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:01:31,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:01:31,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:01:31,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:01:31,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:01:31,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:01:31,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:01:31,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:01:31,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:01:31,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:01:31,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:01:31,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:01:31,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:01:31,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:01:31,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:01:31,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:01:31,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:01:31,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:01:31,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:01:31,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:01:31,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:01:31,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:01:31,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:01:31,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:01:31,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:01:31,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:01:31,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:01:31,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:01:31,153 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:01:31,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:01:31,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:01:31,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:01:31,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:01:31,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:01:31,155 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:01:31,155 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:01:31,155 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:01:31,155 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:01:31,155 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:01:31,156 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:01:31,156 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:01:31,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:01:31,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:01:31,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:31,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:01:31,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:01:31,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:01:31,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:01:31,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:01:31,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:01:31,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:01:31,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:01:31,345 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:01:31,346 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:01:31,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_15-1.c [2023-04-01 00:01:32,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:01:32,823 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:01:32,823 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_15-1.c [2023-04-01 00:01:32,827 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b1e3fa/9cd0573ee1dc482d83f5c6b9ad72174e/FLAG5b8a875f7 [2023-04-01 00:01:32,842 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187b1e3fa/9cd0573ee1dc482d83f5c6b9ad72174e [2023-04-01 00:01:32,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:01:32,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:01:32,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:32,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:01:32,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:01:32,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:32,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1217d4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32, skipping insertion in model container [2023-04-01 00:01:32,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:32,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:01:32,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:01:32,965 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_15-1.c[744,757] [2023-04-01 00:01:32,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:32,975 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:01:32,984 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_15-1.c[744,757] [2023-04-01 00:01:32,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:32,994 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:01:32,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32 WrapperNode [2023-04-01 00:01:32,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:32,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:01:32,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:01:32,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:01:33,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:01:33,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:01:33,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:01:33,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:01:33,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (1/1) ... [2023-04-01 00:01:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:33,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 00:01:33,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 00:01:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:01:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:01:33,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:01:33,087 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2023-04-01 00:01:33,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:01:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:01:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:01:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:01:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:01:33,135 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:01:33,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:01:33,267 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:01:33,284 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:01:33,284 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:01:33,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:33 BoogieIcfgContainer [2023-04-01 00:01:33,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:01:33,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:01:33,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:01:33,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:01:33,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:01:32" (1/3) ... [2023-04-01 00:01:33,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6496797a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:33, skipping insertion in model container [2023-04-01 00:01:33,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:32" (2/3) ... [2023-04-01 00:01:33,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6496797a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:33, skipping insertion in model container [2023-04-01 00:01:33,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:33" (3/3) ... [2023-04-01 00:01:33,310 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_15-1.c [2023-04-01 00:01:33,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:01:33,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:01:33,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:01:33,423 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;@7d19da88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:01:33,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:01:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 00:01:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 00:01:33,449 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:33,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:33,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:33,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash -207187148, now seen corresponding path program 1 times [2023-04-01 00:01:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910666633] [2023-04-01 00:01:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:33,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910666633] [2023-04-01 00:01:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910666633] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513099244] [2023-04-01 00:01:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:33,726 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-01 00:01:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:33,835 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-04-01 00:01:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:33,837 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-01 00:01:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:33,853 INFO L225 Difference]: With dead ends: 33 [2023-04-01 00:01:33,853 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 00:01:33,855 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-01 00:01:33,857 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:33,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 00:01:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 00:01:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 00:01:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 00:01:33,907 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-04-01 00:01:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:33,907 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 00:01:33,907 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-01 00:01:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 00:01:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 00:01:33,908 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:33,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:33,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:01:33,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:33,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1413002183, now seen corresponding path program 1 times [2023-04-01 00:01:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700682149] [2023-04-01 00:01:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:01:33,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700682149] [2023-04-01 00:01:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700682149] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:33,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:33,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015909415] [2023-04-01 00:01:33,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:33,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:33,996 INFO L87 Difference]: Start difference. First operand 21 states and 25 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-01 00:01:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:34,043 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-04-01 00:01:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:34,043 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-01 00:01:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:34,044 INFO L225 Difference]: With dead ends: 27 [2023-04-01 00:01:34,044 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 00:01:34,045 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-01 00:01:34,046 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:34,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 00:01:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-04-01 00:01:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 00:01:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 00:01:34,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-04-01 00:01:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:34,053 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 00:01:34,054 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-01 00:01:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 00:01:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 00:01:34,054 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:34,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:01:34,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:34,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1852803964, now seen corresponding path program 1 times [2023-04-01 00:01:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822020421] [2023-04-01 00:01:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:34,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:34,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822020421] [2023-04-01 00:01:34,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822020421] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429801741] [2023-04-01 00:01:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:34,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:34,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:01:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:34,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:01:34,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 00:01:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429801741] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:34,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428277730] [2023-04-01 00:01:34,452 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:34,452 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:34,461 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:34,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2023-04-01 00:01:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777917138] [2023-04-01 00:01:34,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:34,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 00:01:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 00:01:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:34,472 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:34,561 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-04-01 00:01:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:01:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2023-04-01 00:01:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:34,562 INFO L225 Difference]: With dead ends: 38 [2023-04-01 00:01:34,562 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 00:01:34,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-04-01 00:01:34,563 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:34,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 00:01:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-01 00:01:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 00:01:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-01 00:01:34,568 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2023-04-01 00:01:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:34,568 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-01 00:01:34,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-01 00:01:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 00:01:34,570 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:34,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:34,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:34,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1799377537, now seen corresponding path program 1 times [2023-04-01 00:01:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407659958] [2023-04-01 00:01:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:34,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407659958] [2023-04-01 00:01:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407659958] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686250919] [2023-04-01 00:01:34,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:34,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:34,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:34,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:34,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:01:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:34,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:34,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:01:34,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 00:01:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686250919] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1823733260] [2023-04-01 00:01:35,108 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:35,108 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:35,108 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:35,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 00:01:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416372699] [2023-04-01 00:01:35,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:35,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:01:35,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:01:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:01:35,110 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 00:01:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:35,154 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-04-01 00:01:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:01:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-04-01 00:01:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:35,156 INFO L225 Difference]: With dead ends: 32 [2023-04-01 00:01:35,156 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 00:01:35,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:35,157 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:35,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 55 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 00:01:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 00:01:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 00:01:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-04-01 00:01:35,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2023-04-01 00:01:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:35,162 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-04-01 00:01:35,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 00:01:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-04-01 00:01:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:01:35,163 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:35,163 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:35,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 00:01:35,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 00:01:35,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:35,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1917676903, now seen corresponding path program 2 times [2023-04-01 00:01:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538790506] [2023-04-01 00:01:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 00:01:35,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538790506] [2023-04-01 00:01:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538790506] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832119121] [2023-04-01 00:01:35,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:35,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:35,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:01:35,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 00:01:35,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:35,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:35,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 00:01:35,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:01:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832119121] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282077683] [2023-04-01 00:01:35,656 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:35,656 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:35,656 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:35,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2023-04-01 00:01:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489209165] [2023-04-01 00:01:35,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:35,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 00:01:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 00:01:35,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:01:35,658 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 00:01:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:35,802 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2023-04-01 00:01:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:01:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) Word has length 40 [2023-04-01 00:01:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:35,804 INFO L225 Difference]: With dead ends: 59 [2023-04-01 00:01:35,804 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 00:01:35,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-04-01 00:01:35,805 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:35,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 00:01:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-04-01 00:01:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-01 00:01:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-04-01 00:01:35,810 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2023-04-01 00:01:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:35,810 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-04-01 00:01:35,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 00:01:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-04-01 00:01:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 00:01:35,811 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:35,811 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:35,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 00:01:36,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:36,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:36,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash -660284548, now seen corresponding path program 3 times [2023-04-01 00:01:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:36,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6878843] [2023-04-01 00:01:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:01:36,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6878843] [2023-04-01 00:01:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6878843] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:36,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561584490] [2023-04-01 00:01:36,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:36,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:36,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:36,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:36,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 00:01:36,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:36,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:36,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:01:36,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:01:36,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 00:01:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561584490] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:36,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087145127] [2023-04-01 00:01:36,361 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:36,361 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:36,362 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:36,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 00:01:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171318901] [2023-04-01 00:01:36,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:36,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 00:01:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 00:01:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:36,363 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:36,417 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2023-04-01 00:01:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:01:36,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 41 [2023-04-01 00:01:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:36,419 INFO L225 Difference]: With dead ends: 40 [2023-04-01 00:01:36,419 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 00:01:36,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:01:36,420 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:36,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 79 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 00:01:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 00:01:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-01 00:01:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-04-01 00:01:36,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 41 [2023-04-01 00:01:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:36,425 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-04-01 00:01:36,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 00:01:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-04-01 00:01:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-04-01 00:01:36,427 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:36,427 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:36,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 00:01:36,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:36,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:36,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash 754596439, now seen corresponding path program 4 times [2023-04-01 00:01:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412062785] [2023-04-01 00:01:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-04-01 00:01:36,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412062785] [2023-04-01 00:01:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412062785] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804973546] [2023-04-01 00:01:36,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:36,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 00:01:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:37,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:01:37,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-04-01 00:01:37,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2023-04-01 00:01:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804973546] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273938065] [2023-04-01 00:01:37,478 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:37,478 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:37,478 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:37,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:37,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 00:01:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209370518] [2023-04-01 00:01:37,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 00:01:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 00:01:37,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 00:01:37,480 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 00:01:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:37,560 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2023-04-01 00:01:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:01:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 96 [2023-04-01 00:01:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:37,562 INFO L225 Difference]: With dead ends: 45 [2023-04-01 00:01:37,562 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 00:01:37,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:37,563 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:37,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 89 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 00:01:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-01 00:01:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (28), 10 states have call predecessors, (28), 7 states have call successors, (28) [2023-04-01 00:01:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2023-04-01 00:01:37,568 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 96 [2023-04-01 00:01:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:37,568 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-04-01 00:01:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 00:01:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2023-04-01 00:01:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-04-01 00:01:37,571 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:37,571 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:37,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:37,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:37,777 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:37,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 249620502, now seen corresponding path program 5 times [2023-04-01 00:01:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974426120] [2023-04-01 00:01:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 86 proven. 516 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2023-04-01 00:01:37,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974426120] [2023-04-01 00:01:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974426120] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697860156] [2023-04-01 00:01:37,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:37,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:37,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:37,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 00:01:38,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 00:01:38,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:38,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:01:38,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 17 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2023-04-01 00:01:38,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 18 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2023-04-01 00:01:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697860156] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588714668] [2023-04-01 00:01:38,551 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:38,552 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:38,552 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:38,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2023-04-01 00:01:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131361908] [2023-04-01 00:01:38,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:38,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 00:01:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 00:01:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:38,554 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2023-04-01 00:01:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:38,796 INFO L93 Difference]: Finished difference Result 98 states and 195 transitions. [2023-04-01 00:01:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 00:01:38,796 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 192 [2023-04-01 00:01:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:38,798 INFO L225 Difference]: With dead ends: 98 [2023-04-01 00:01:38,798 INFO L226 Difference]: Without dead ends: 62 [2023-04-01 00:01:38,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 378 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2023-04-01 00:01:38,799 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:38,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 118 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-01 00:01:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-04-01 00:01:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 00:01:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2023-04-01 00:01:38,806 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 192 [2023-04-01 00:01:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:38,806 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2023-04-01 00:01:38,806 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2023-04-01 00:01:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2023-04-01 00:01:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-04-01 00:01:38,808 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:38,808 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:38,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:39,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:39,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:39,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1950698244, now seen corresponding path program 6 times [2023-04-01 00:01:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576130923] [2023-04-01 00:01:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 00:01:39,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576130923] [2023-04-01 00:01:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576130923] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574940578] [2023-04-01 00:01:39,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:39,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:39,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 00:01:39,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:39,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:39,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:01:39,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 00:01:39,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2023-04-01 00:01:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574940578] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237769557] [2023-04-01 00:01:40,288 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:40,288 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:40,288 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:40,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:40,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 00:01:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191195796] [2023-04-01 00:01:40,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:40,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:01:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:40,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:01:40,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:40,290 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 00:01:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:40,387 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2023-04-01 00:01:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:01:40,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) Word has length 177 [2023-04-01 00:01:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:40,389 INFO L225 Difference]: With dead ends: 71 [2023-04-01 00:01:40,389 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 00:01:40,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:01:40,390 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:40,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 88 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 00:01:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-04-01 00:01:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (31), 14 states have call predecessors, (31), 12 states have call successors, (31) [2023-04-01 00:01:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-04-01 00:01:40,396 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 177 [2023-04-01 00:01:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:40,396 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-04-01 00:01:40,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 00:01:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-04-01 00:01:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-04-01 00:01:40,399 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:40,399 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:40,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:40,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:40,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:40,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash -661454596, now seen corresponding path program 7 times [2023-04-01 00:01:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614578471] [2023-04-01 00:01:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1259 refuted. 0 times theorem prover too weak. 4042 trivial. 0 not checked. [2023-04-01 00:01:40,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614578471] [2023-04-01 00:01:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614578471] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212985916] [2023-04-01 00:01:40,988 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:41,003 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:41,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:01:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:41,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 00:01:41,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1259 refuted. 0 times theorem prover too weak. 4042 trivial. 0 not checked. [2023-04-01 00:01:41,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1316 refuted. 0 times theorem prover too weak. 3985 trivial. 0 not checked. [2023-04-01 00:01:42,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212985916] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33179948] [2023-04-01 00:01:42,750 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:42,750 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:42,751 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:42,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 00:01:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422718311] [2023-04-01 00:01:42,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:42,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 00:01:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 00:01:42,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 00:01:42,753 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 00:01:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:42,882 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2023-04-01 00:01:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:01:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 313 [2023-04-01 00:01:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:42,883 INFO L225 Difference]: With dead ends: 76 [2023-04-01 00:01:42,883 INFO L226 Difference]: Without dead ends: 72 [2023-04-01 00:01:42,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 618 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:01:42,885 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:42,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 112 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-01 00:01:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-04-01 00:01:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 14 states have call successors, (14), 9 states have call predecessors, (14), 10 states have return successors, (41), 16 states have call predecessors, (41), 13 states have call successors, (41) [2023-04-01 00:01:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2023-04-01 00:01:42,891 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 313 [2023-04-01 00:01:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:42,891 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2023-04-01 00:01:42,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 00:01:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2023-04-01 00:01:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2023-04-01 00:01:42,896 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:42,897 INFO L195 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:42,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-01 00:01:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 00:01:43,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:43,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1814099002, now seen corresponding path program 8 times [2023-04-01 00:01:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792972779] [2023-04-01 00:01:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 422 proven. 2921 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2023-04-01 00:01:43,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792972779] [2023-04-01 00:01:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792972779] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452766828] [2023-04-01 00:01:43,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:43,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:43,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:43,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:43,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:01:43,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2023-04-01 00:01:43,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:43,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 00:01:43,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 293 refuted. 0 times theorem prover too weak. 15890 trivial. 0 not checked. [2023-04-01 00:01:43,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 314 refuted. 0 times theorem prover too weak. 15869 trivial. 0 not checked. [2023-04-01 00:01:45,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452766828] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:45,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [507340553] [2023-04-01 00:01:45,748 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:45,748 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:45,748 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:45,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2023-04-01 00:01:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872390117] [2023-04-01 00:01:45,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-01 00:01:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-01 00:01:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:01:45,751 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 00:01:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:46,232 INFO L93 Difference]: Finished difference Result 185 states and 370 transitions. [2023-04-01 00:01:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-01 00:01:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) Word has length 572 [2023-04-01 00:01:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:46,234 INFO L225 Difference]: With dead ends: 185 [2023-04-01 00:01:46,234 INFO L226 Difference]: Without dead ends: 118 [2023-04-01 00:01:46,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1130 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=758, Invalid=2548, Unknown=0, NotChecked=0, Total=3306 [2023-04-01 00:01:46,236 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 174 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:46,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 165 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-04-01 00:01:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2023-04-01 00:01:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 70 states have internal predecessors, (79), 20 states have call successors, (20), 17 states have call predecessors, (20), 11 states have return successors, (46), 18 states have call predecessors, (46), 19 states have call successors, (46) [2023-04-01 00:01:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2023-04-01 00:01:46,261 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 572 [2023-04-01 00:01:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:46,264 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2023-04-01 00:01:46,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 00:01:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2023-04-01 00:01:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2023-04-01 00:01:46,275 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:46,275 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:46,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:46,476 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:46,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash 608566348, now seen corresponding path program 9 times [2023-04-01 00:01:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426780637] [2023-04-01 00:01:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 00:01:47,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426780637] [2023-04-01 00:01:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426780637] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639012565] [2023-04-01 00:01:47,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:47,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:47,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:01:48,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:48,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:48,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 1692 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 00:01:48,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 00:01:48,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2023-04-01 00:01:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639012565] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344218100] [2023-04-01 00:01:52,017 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:01:52,018 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:52,018 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:52,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2023-04-01 00:01:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672601039] [2023-04-01 00:01:52,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:01:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:01:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:01:52,020 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) [2023-04-01 00:01:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:52,165 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2023-04-01 00:01:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:01:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) Word has length 749 [2023-04-01 00:01:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:52,167 INFO L225 Difference]: With dead ends: 115 [2023-04-01 00:01:52,167 INFO L226 Difference]: Without dead ends: 111 [2023-04-01 00:01:52,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1527 GetRequests, 1488 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:01:52,168 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:52,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 153 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-01 00:01:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-04-01 00:01:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 73 states have internal predecessors, (82), 21 states have call successors, (21), 17 states have call predecessors, (21), 12 states have return successors, (55), 20 states have call predecessors, (55), 20 states have call successors, (55) [2023-04-01 00:01:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2023-04-01 00:01:52,174 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 749 [2023-04-01 00:01:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:52,175 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2023-04-01 00:01:52,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (29), 10 states have call predecessors, (29), 20 states have call successors, (29) [2023-04-01 00:01:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2023-04-01 00:01:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1540 [2023-04-01 00:01:52,187 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:52,188 INFO L195 NwaCegarLoop]: trace histogram [225, 225, 182, 112, 112, 112, 112, 112, 112, 112, 70, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:52,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:52,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 00:01:52,395 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:52,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1817407116, now seen corresponding path program 10 times [2023-04-01 00:01:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:52,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074005503] [2023-04-01 00:01:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 1361 proven. 10715 refuted. 0 times theorem prover too weak. 130059 trivial. 0 not checked. [2023-04-01 00:01:54,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074005503] [2023-04-01 00:01:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074005503] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25586640] [2023-04-01 00:01:54,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:54,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:54,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:54,705 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:54,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:01:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:55,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 3446 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:01:55,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 1361 proven. 10715 refuted. 0 times theorem prover too weak. 130059 trivial. 0 not checked. [2023-04-01 00:01:55,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 142135 backedges. 1361 proven. 10841 refuted. 0 times theorem prover too weak. 129933 trivial. 0 not checked. [2023-04-01 00:02:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25586640] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1254916439] [2023-04-01 00:02:00,610 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:02:00,611 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:00,611 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:00,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2023-04-01 00:02:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690881456] [2023-04-01 00:02:00,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:00,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:02:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:02:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:02:00,615 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) [2023-04-01 00:02:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:00,744 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2023-04-01 00:02:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 00:02:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) Word has length 1539 [2023-04-01 00:02:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:00,749 INFO L225 Difference]: With dead ends: 120 [2023-04-01 00:02:00,749 INFO L226 Difference]: Without dead ends: 116 [2023-04-01 00:02:00,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3110 GetRequests, 3067 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 00:02:00,751 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 143 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:00,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 121 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-04-01 00:02:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-04-01 00:02:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.0625) internal successors, (85), 76 states have internal predecessors, (85), 22 states have call successors, (22), 17 states have call predecessors, (22), 13 states have return successors, (66), 22 states have call predecessors, (66), 21 states have call successors, (66) [2023-04-01 00:02:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2023-04-01 00:02:00,785 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 1539 [2023-04-01 00:02:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:00,788 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2023-04-01 00:02:00,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (32), 11 states have call predecessors, (32), 22 states have call successors, (32) [2023-04-01 00:02:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2023-04-01 00:02:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2248 [2023-04-01 00:02:00,864 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:00,864 INFO L195 NwaCegarLoop]: trace histogram [329, 329, 266, 164, 164, 164, 164, 164, 164, 164, 102, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:00,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 00:02:01,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:01,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2137207054, now seen corresponding path program 11 times [2023-04-01 00:02:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360251104] [2023-04-01 00:02:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 304533 backedges. 2112 proven. 17592 refuted. 0 times theorem prover too weak. 284829 trivial. 0 not checked. [2023-04-01 00:02:04,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360251104] [2023-04-01 00:02:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360251104] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416591560] [2023-04-01 00:02:04,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:04,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:04,152 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:04,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 00:02:04,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2023-04-01 00:02:04,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:04,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-01 00:02:04,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 304533 backedges. 2112 proven. 17592 refuted. 0 times theorem prover too weak. 284829 trivial. 0 not checked. [2023-04-01 00:02:04,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 304533 backedges. 2112 proven. 17747 refuted. 0 times theorem prover too weak. 284674 trivial. 0 not checked. [2023-04-01 00:02:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416591560] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [771986866] [2023-04-01 00:02:13,117 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:02:13,117 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:13,118 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:13,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2023-04-01 00:02:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168964255] [2023-04-01 00:02:13,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:13,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 00:02:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 00:02:13,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2023-04-01 00:02:13,122 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 12 states have call predecessors, (35), 24 states have call successors, (35) [2023-04-01 00:02:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:13,261 INFO L93 Difference]: Finished difference Result 125 states and 195 transitions. [2023-04-01 00:02:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 00:02:13,261 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 12 states have call predecessors, (35), 24 states have call successors, (35) Word has length 2247 [2023-04-01 00:02:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:13,264 INFO L225 Difference]: With dead ends: 125 [2023-04-01 00:02:13,265 INFO L226 Difference]: Without dead ends: 121 [2023-04-01 00:02:13,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4529 GetRequests, 4482 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 00:02:13,266 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 106 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:13,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 145 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-04-01 00:02:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-04-01 00:02:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 79 states have internal predecessors, (88), 23 states have call successors, (23), 17 states have call predecessors, (23), 14 states have return successors, (79), 24 states have call predecessors, (79), 22 states have call successors, (79) [2023-04-01 00:02:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 190 transitions. [2023-04-01 00:02:13,279 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 190 transitions. Word has length 2247 [2023-04-01 00:02:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:13,280 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 190 transitions. [2023-04-01 00:02:13,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (35), 12 states have call predecessors, (35), 24 states have call successors, (35) [2023-04-01 00:02:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 190 transitions. [2023-04-01 00:02:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4359 [2023-04-01 00:02:13,417 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:13,418 INFO L195 NwaCegarLoop]: trace histogram [639, 639, 517, 319, 319, 319, 319, 319, 319, 319, 198, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:13,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:13,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 00:02:13,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:13,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1196784336, now seen corresponding path program 12 times [2023-04-01 00:02:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341115050] [2023-04-01 00:02:13,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:13,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1151634 backedges. 4444 proven. 38037 refuted. 0 times theorem prover too weak. 1109153 trivial. 0 not checked. [2023-04-01 00:02:21,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341115050] [2023-04-01 00:02:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341115050] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526705613] [2023-04-01 00:02:21,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:21,845 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 00:02:22,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:22,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:23,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 7761 conjuncts, 38 conjunts are in the unsatisfiable core [2023-04-01 00:02:23,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1151634 backedges. 527075 proven. 14199 refuted. 0 times theorem prover too weak. 610360 trivial. 0 not checked. [2023-04-01 00:02:23,469 INFO L327 TraceCheckSpWp]: Computing backward predicates...