/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/recursive/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 12:11:21,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 12:11:21,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 12:11:21,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 12:11:21,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 12:11:21,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 12:11:21,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 12:11:21,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 12:11:21,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 12:11:21,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 12:11:21,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 12:11:21,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 12:11:21,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 12:11:21,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 12:11:21,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 12:11:21,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 12:11:21,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 12:11:21,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 12:11:21,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 12:11:21,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 12:11:21,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 12:11:21,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 12:11:21,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 12:11:21,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 12:11:21,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 12:11:21,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 12:11:21,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 12:11:21,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 12:11:21,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 12:11:21,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 12:11:21,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 12:11:21,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 12:11:21,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 12:11:21,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 12:11:21,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 12:11:21,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 12:11:21,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 12:11:21,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 12:11:21,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 12:11:21,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 12:11:21,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 12:11:21,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 12:11:21,299 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 12:11:21,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 12:11:21,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 12:11:21,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 12:11:21,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 12:11:21,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 12:11:21,300 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 12:11:21,300 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 12:11:21,300 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 12:11:21,301 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 12:11:21,301 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 12:11:21,301 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 12:11:21,301 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 12:11:21,302 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 12:11:21,302 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 12:11:21,302 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 12:11:21,302 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 12:11:21,302 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 12:11:21,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 12:11:21,302 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 12:11:21,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 12:11:21,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:11:21,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 12:11:21,304 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 12:11:21,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 12:11:21,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 12:11:21,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 12:11:21,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 12:11:21,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 12:11:21,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 12:11:21,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 12:11:21,492 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 12:11:21,493 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 12:11:21,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2023-04-01 12:11:22,614 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 12:11:22,797 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 12:11:22,797 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2023-04-01 12:11:22,801 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248e5c3f2/d919f1f09b1f417c8373d70720d28312/FLAGd677e34a8 [2023-04-01 12:11:22,811 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/248e5c3f2/d919f1f09b1f417c8373d70720d28312 [2023-04-01 12:11:22,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 12:11:22,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 12:11:22,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 12:11:22,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 12:11:22,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 12:11:22,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74620e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22, skipping insertion in model container [2023-04-01 12:11:22,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 12:11:22,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 12:11:22,917 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/Fibonacci01-1.c[804,817] [2023-04-01 12:11:22,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:11:22,926 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 12:11:22,935 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/Fibonacci01-1.c[804,817] [2023-04-01 12:11:22,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:11:22,943 INFO L208 MainTranslator]: Completed translation [2023-04-01 12:11:22,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22 WrapperNode [2023-04-01 12:11:22,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 12:11:22,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 12:11:22,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 12:11:22,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 12:11:22,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 12:11:22,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 12:11:22,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 12:11:22,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 12:11:22,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (1/1) ... [2023-04-01 12:11:22,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:11:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:23,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 12:11:23,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 12:11:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 12:11:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 12:11:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 12:11:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-04-01 12:11:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 12:11:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 12:11:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 12:11:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 12:11:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 12:11:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 12:11:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 12:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 12:11:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 12:11:23,110 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 12:11:23,111 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 12:11:23,186 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 12:11:23,195 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 12:11:23,195 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 12:11:23,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:11:23 BoogieIcfgContainer [2023-04-01 12:11:23,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 12:11:23,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 12:11:23,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 12:11:23,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 12:11:23,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:11:22" (1/3) ... [2023-04-01 12:11:23,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439e08bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:11:23, skipping insertion in model container [2023-04-01 12:11:23,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:22" (2/3) ... [2023-04-01 12:11:23,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439e08bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:11:23, skipping insertion in model container [2023-04-01 12:11:23,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:11:23" (3/3) ... [2023-04-01 12:11:23,201 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2023-04-01 12:11:23,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 12:11:23,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 12:11:23,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 12:11:23,243 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;@123ff993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 12:11:23,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 12:11:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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 12:11:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 12:11:23,250 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:23,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:11:23,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:23,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1664353218, now seen corresponding path program 1 times [2023-04-01 12:11:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830326581] [2023-04-01 12:11:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:11:23,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830326581] [2023-04-01 12:11:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830326581] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:11:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:11:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 12:11:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908026160] [2023-04-01 12:11:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:11:23,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 12:11:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 12:11:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 12:11:23,534 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:11:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:23,619 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-04-01 12:11:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 12:11:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-04-01 12:11:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:23,626 INFO L225 Difference]: With dead ends: 36 [2023-04-01 12:11:23,626 INFO L226 Difference]: Without dead ends: 22 [2023-04-01 12:11:23,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 12:11:23,630 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:23,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-04-01 12:11:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-04-01 12:11:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 12:11:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-01 12:11:23,656 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2023-04-01 12:11:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:23,656 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-01 12:11:23,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:11:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-01 12:11:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 12:11:23,657 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:23,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:11:23,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 12:11:23,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:23,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 636937174, now seen corresponding path program 1 times [2023-04-01 12:11:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601799329] [2023-04-01 12:11:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:11:23,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601799329] [2023-04-01 12:11:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601799329] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:11:23,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:11:23,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 12:11:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113299138] [2023-04-01 12:11:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:11:23,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 12:11:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 12:11:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 12:11:23,801 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:11:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:23,861 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-04-01 12:11:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 12:11:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-04-01 12:11:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:23,862 INFO L225 Difference]: With dead ends: 28 [2023-04-01 12:11:23,862 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 12:11:23,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 12:11:23,864 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:23,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:11:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 12:11:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-04-01 12:11:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 12:11:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-01 12:11:23,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-04-01 12:11:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:23,869 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-01 12:11:23,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 12:11:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-01 12:11:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 12:11:23,870 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:23,870 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 12:11:23,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 12:11:23,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:23,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1287007975, now seen corresponding path program 1 times [2023-04-01 12:11:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152730167] [2023-04-01 12:11:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:23,943 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 12:11:23,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152730167] [2023-04-01 12:11:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152730167] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205666655] [2023-04-01 12:11:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:23,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:23,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:23,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:23,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 12:11:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:24,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 12:11:24,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:24,181 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 12:11:24,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:11:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205666655] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [239146121] [2023-04-01 12:11:24,522 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:24,523 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:24,525 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:24,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2023-04-01 12:11:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952911373] [2023-04-01 12:11:24,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:24,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 12:11:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 12:11:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-04-01 12:11:24,528 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 12:11:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:24,645 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-04-01 12:11:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 12:11:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 27 [2023-04-01 12:11:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:24,646 INFO L225 Difference]: With dead ends: 39 [2023-04-01 12:11:24,647 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 12:11:24,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-04-01 12:11:24,648 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:24,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 143 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:24,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 12:11:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-01 12:11:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 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 12:11:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-04-01 12:11:24,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2023-04-01 12:11:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:24,652 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-04-01 12:11:24,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-01 12:11:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-04-01 12:11:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-01 12:11:24,653 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:24,653 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, 1] [2023-04-01 12:11:24,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 12:11:24,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:24,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:24,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1223990277, now seen corresponding path program 1 times [2023-04-01 12:11:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945457891] [2023-04-01 12:11:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:11:25,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945457891] [2023-04-01 12:11:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945457891] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358785381] [2023-04-01 12:11:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:25,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:25,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:25,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 12:11:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:25,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 12:11:25,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:25,201 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 12:11:25,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:11:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358785381] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1673324285] [2023-04-01 12:11:25,516 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:25,516 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:25,516 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:25,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:25,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2023-04-01 12:11:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732428077] [2023-04-01 12:11:25,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:25,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-01 12:11:25,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-01 12:11:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-04-01 12:11:25,521 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 12:11:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:25,700 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-04-01 12:11:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 12:11:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 28 [2023-04-01 12:11:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:25,701 INFO L225 Difference]: With dead ends: 36 [2023-04-01 12:11:25,702 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 12:11:25,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2023-04-01 12:11:25,703 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:25,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 12:11:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-04-01 12:11:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 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 12:11:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-04-01 12:11:25,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2023-04-01 12:11:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:25,708 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-04-01 12:11:25,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 17 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 12:11:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-04-01 12:11:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 12:11:25,709 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:25,709 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, 1] [2023-04-01 12:11:25,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:25,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 12:11:25,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:25,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2120283314, now seen corresponding path program 2 times [2023-04-01 12:11:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136881724] [2023-04-01 12:11:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:25,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:26,076 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 12:11:26,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:26,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136881724] [2023-04-01 12:11:26,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136881724] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:26,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651573142] [2023-04-01 12:11:26,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:11:26,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:26,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:26,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:26,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 12:11:26,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 12:11:26,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:11:26,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-01 12:11:26,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 12:11:26,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 12:11:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651573142] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:26,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133025860] [2023-04-01 12:11:26,779 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:26,779 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:26,779 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:26,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 27 [2023-04-01 12:11:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249070585] [2023-04-01 12:11:26,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:26,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 12:11:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 12:11:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2023-04-01 12:11:26,784 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 21 states have internal predecessors, (50), 8 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (15), 14 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-01 12:11:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:27,120 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2023-04-01 12:11:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 12:11:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 21 states have internal predecessors, (50), 8 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (15), 14 states have call predecessors, (15), 8 states have call successors, (15) Word has length 41 [2023-04-01 12:11:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:27,122 INFO L225 Difference]: With dead ends: 57 [2023-04-01 12:11:27,122 INFO L226 Difference]: Without dead ends: 35 [2023-04-01 12:11:27,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 12:11:27,123 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:27,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 174 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-01 12:11:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-04-01 12:11:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 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 12:11:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-04-01 12:11:27,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 41 [2023-04-01 12:11:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:27,128 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-04-01 12:11:27,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 21 states have internal predecessors, (50), 8 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (15), 14 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-01 12:11:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-04-01 12:11:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-01 12:11:27,133 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:27,133 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, 1] [2023-04-01 12:11:27,153 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 12:11:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:27,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:27,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash 850486598, now seen corresponding path program 3 times [2023-04-01 12:11:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11189422] [2023-04-01 12:11:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 12:11:27,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11189422] [2023-04-01 12:11:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11189422] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216807630] [2023-04-01 12:11:27,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:11:27,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:27,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 12:11:27,648 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:11:27,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:11:27,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-01 12:11:27,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-01 12:11:27,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-01 12:11:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216807630] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:28,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1753269440] [2023-04-01 12:11:28,342 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:28,342 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:28,342 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:28,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 29 [2023-04-01 12:11:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808982759] [2023-04-01 12:11:28,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:28,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 12:11:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 12:11:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2023-04-01 12:11:28,344 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-01 12:11:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:28,679 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2023-04-01 12:11:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 12:11:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) Word has length 42 [2023-04-01 12:11:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:28,681 INFO L225 Difference]: With dead ends: 57 [2023-04-01 12:11:28,681 INFO L226 Difference]: Without dead ends: 51 [2023-04-01 12:11:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1650, Unknown=0, NotChecked=0, Total=1980 [2023-04-01 12:11:28,683 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:28,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 162 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:11:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-01 12:11:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2023-04-01 12:11:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 3 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 12:11:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2023-04-01 12:11:28,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 42 [2023-04-01 12:11:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:28,691 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2023-04-01 12:11:28,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (15), 13 states have call predecessors, (15), 8 states have call successors, (15) [2023-04-01 12:11:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2023-04-01 12:11:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-04-01 12:11:28,693 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:28,693 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:11:28,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:28,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:28,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:28,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash -867582455, now seen corresponding path program 4 times [2023-04-01 12:11:28,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:28,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034561316] [2023-04-01 12:11:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 55 proven. 93 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-04-01 12:11:28,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034561316] [2023-04-01 12:11:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034561316] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032091641] [2023-04-01 12:11:28,997 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:11:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:29,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:29,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 12:11:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:29,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 12:11:29,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 72 proven. 104 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-04-01 12:11:29,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 72 proven. 107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-04-01 12:11:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032091641] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2102229419] [2023-04-01 12:11:29,506 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:29,507 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:29,507 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:29,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2023-04-01 12:11:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447934004] [2023-04-01 12:11:29,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 12:11:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 12:11:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-04-01 12:11:29,509 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 10 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2023-04-01 12:11:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:29,646 INFO L93 Difference]: Finished difference Result 82 states and 146 transitions. [2023-04-01 12:11:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:11:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 10 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Word has length 83 [2023-04-01 12:11:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:29,648 INFO L225 Difference]: With dead ends: 82 [2023-04-01 12:11:29,648 INFO L226 Difference]: Without dead ends: 50 [2023-04-01 12:11:29,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2023-04-01 12:11:29,649 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 60 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:29,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 95 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-01 12:11:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-04-01 12:11:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (19), 10 states have call predecessors, (19), 7 states have call successors, (19) [2023-04-01 12:11:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-04-01 12:11:29,655 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 83 [2023-04-01 12:11:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:29,655 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-04-01 12:11:29,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 10 states have call successors, (16), 1 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2023-04-01 12:11:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-04-01 12:11:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-04-01 12:11:29,656 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:29,656 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, 1] [2023-04-01 12:11:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:29,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:29,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:29,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2042034856, now seen corresponding path program 5 times [2023-04-01 12:11:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935967607] [2023-04-01 12:11:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-04-01 12:11:30,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935967607] [2023-04-01 12:11:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935967607] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47919769] [2023-04-01 12:11:30,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:11:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:30,033 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:30,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 12:11:30,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 12:11:30,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:11:30,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:11:30,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-04-01 12:11:30,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-04-01 12:11:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47919769] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [690873014] [2023-04-01 12:11:30,498 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:30,498 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:30,498 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:30,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 18 [2023-04-01 12:11:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572593406] [2023-04-01 12:11:30,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:30,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 12:11:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:30,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 12:11:30,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-04-01 12:11:30,500 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2023-04-01 12:11:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:30,727 INFO L93 Difference]: Finished difference Result 101 states and 156 transitions. [2023-04-01 12:11:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 12:11:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 97 [2023-04-01 12:11:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:30,729 INFO L225 Difference]: With dead ends: 101 [2023-04-01 12:11:30,729 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 12:11:30,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-04-01 12:11:30,730 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 62 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:30,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 12:11:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2023-04-01 12:11:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) [2023-04-01 12:11:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-04-01 12:11:30,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 97 [2023-04-01 12:11:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:30,737 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-04-01 12:11:30,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2023-04-01 12:11:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-04-01 12:11:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-04-01 12:11:30,738 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:30,738 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:11:30,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:30,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:30,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:30,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 695133459, now seen corresponding path program 6 times [2023-04-01 12:11:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524788215] [2023-04-01 12:11:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 181 proven. 305 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-04-01 12:11:31,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524788215] [2023-04-01 12:11:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524788215] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346599386] [2023-04-01 12:11:31,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:11:31,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:31,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:31,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:11:31,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 12:11:31,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:11:31,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:11:31,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 12:11:31,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-04-01 12:11:31,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-04-01 12:11:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346599386] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1626502812] [2023-04-01 12:11:32,357 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:32,357 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:32,357 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:32,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2023-04-01 12:11:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637111123] [2023-04-01 12:11:32,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:32,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 12:11:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 12:11:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-04-01 12:11:32,359 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 17 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 11 states have call predecessors, (28), 17 states have call successors, (28) [2023-04-01 12:11:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:32,661 INFO L93 Difference]: Finished difference Result 125 states and 183 transitions. [2023-04-01 12:11:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-01 12:11:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 17 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 11 states have call predecessors, (28), 17 states have call successors, (28) Word has length 137 [2023-04-01 12:11:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:32,663 INFO L225 Difference]: With dead ends: 125 [2023-04-01 12:11:32,663 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 12:11:32,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 259 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 12:11:32,664 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 87 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:32,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 156 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:11:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 12:11:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2023-04-01 12:11:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 46 states have internal predecessors, (53), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (32), 15 states have call predecessors, (32), 12 states have call successors, (32) [2023-04-01 12:11:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2023-04-01 12:11:32,675 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 137 [2023-04-01 12:11:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:32,676 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2023-04-01 12:11:32,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 24 states have internal predecessors, (74), 17 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 11 states have call predecessors, (28), 17 states have call successors, (28) [2023-04-01 12:11:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2023-04-01 12:11:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-04-01 12:11:32,677 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:11:32,677 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, 1] [2023-04-01 12:11:32,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:32,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:32,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:11:32,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:11:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 299544726, now seen corresponding path program 7 times [2023-04-01 12:11:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:11:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485373699] [2023-04-01 12:11:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:11:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:11:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 77 proven. 845 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2023-04-01 12:11:33,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:11:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485373699] [2023-04-01 12:11:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485373699] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:11:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920254977] [2023-04-01 12:11:33,711 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:11:33,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:11:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:33,725 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 12:11:33,766 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 12:11:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:11:33,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 65 conjunts are in the unsatisfiable core [2023-04-01 12:11:33,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:11:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 258 proven. 604 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2023-04-01 12:11:34,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:11:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 207 proven. 695 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2023-04-01 12:11:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920254977] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:11:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949269404] [2023-04-01 12:11:40,115 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-01 12:11:40,115 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:11:40,115 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:11:40,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:11:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 35] total 65 [2023-04-01 12:11:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907288877] [2023-04-01 12:11:40,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:11:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-04-01 12:11:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:11:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-04-01 12:11:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3737, Unknown=0, NotChecked=0, Total=4160 [2023-04-01 12:11:40,120 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 65 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 40 states have internal predecessors, (90), 19 states have call successors, (22), 1 states have call predecessors, (22), 17 states have return successors, (43), 38 states have call predecessors, (43), 19 states have call successors, (43) [2023-04-01 12:11:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:11:41,068 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2023-04-01 12:11:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-04-01 12:11:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 40 states have internal predecessors, (90), 19 states have call successors, (22), 1 states have call predecessors, (22), 17 states have return successors, (43), 38 states have call predecessors, (43), 19 states have call successors, (43) Word has length 178 [2023-04-01 12:11:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:11:41,069 INFO L225 Difference]: With dead ends: 110 [2023-04-01 12:11:41,069 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 12:11:41,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 313 SyntacticMatches, 38 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5069 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1106, Invalid=8206, Unknown=0, NotChecked=0, Total=9312 [2023-04-01 12:11:41,071 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 12:11:41,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 362 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 12:11:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 12:11:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 12:11:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 12:11:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 12:11:41,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2023-04-01 12:11:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:11:41,072 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 12:11:41,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 40 states have internal predecessors, (90), 19 states have call successors, (22), 1 states have call predecessors, (22), 17 states have return successors, (43), 38 states have call predecessors, (43), 19 states have call successors, (43) [2023-04-01 12:11:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 12:11:41,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 12:11:41,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 12:11:41,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 12:11:41,297 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 12:11:41,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 12:11:41,570 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-01 12:11:41,570 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-01 12:11:41,570 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-04-01 12:11:41,570 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (< 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2023-04-01 12:11:41,570 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (and (let ((.cse0 (<= 4 |fibonacci_#in~n|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 3 |fibonacci_#t~ret4|) .cse0 .cse1 (<= |fibonacci_#in~n| 5)) (and .cse0 (<= |fibonacci_#in~n| 4) .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2))) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1)) .cse0 .cse1) (and (= |fibonacci_#t~ret4| 1) .cse1 (<= |fibonacci_#in~n| 3)))) (< 1 |fibonacci_#in~n|)) [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2023-04-01 12:11:41,572 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 38) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 27 38) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 27 38) the Hoare annotation is: true [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-01 12:11:41,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 12:11:41,573 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 12:11:41,577 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-04-01 12:11:41,578 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 12:11:41,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:11:41 BoogieIcfgContainer [2023-04-01 12:11:41,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 12:11:41,581 INFO L158 Benchmark]: Toolchain (without parser) took 18765.59ms. Allocated memory was 275.8MB in the beginning and 515.9MB in the end (delta: 240.1MB). Free memory was 237.8MB in the beginning and 334.8MB in the end (delta: -97.1MB). Peak memory consumption was 144.6MB. Max. memory is 8.0GB. [2023-04-01 12:11:41,581 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 12:11:41,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 127.46ms. Allocated memory is still 275.8MB. Free memory was 237.8MB in the beginning and 227.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 12:11:41,581 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 275.8MB. Free memory was 227.8MB in the beginning and 226.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 12:11:41,581 INFO L158 Benchmark]: RCFGBuilder took 212.22ms. Allocated memory is still 275.8MB. Free memory was 226.2MB in the beginning and 215.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 12:11:41,582 INFO L158 Benchmark]: TraceAbstraction took 18382.92ms. Allocated memory was 275.8MB in the beginning and 515.9MB in the end (delta: 240.1MB). Free memory was 214.7MB in the beginning and 334.8MB in the end (delta: -120.1MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2023-04-01 12:11:41,583 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 127.46ms. Allocated memory is still 275.8MB. Free memory was 237.8MB in the beginning and 227.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 275.8MB. Free memory was 227.8MB in the beginning and 226.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 212.22ms. Allocated memory is still 275.8MB. Free memory was 226.2MB in the beginning and 215.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18382.92ms. Allocated memory was 275.8MB in the beginning and 515.9MB in the end (delta: 240.1MB). Free memory was 214.7MB in the beginning and 334.8MB in the end (delta: -120.1MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 10, TraceHistogramMax: 25, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 1490 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 187 mSDtfsCounter, 3057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1527 GetRequests, 1132 SyntacticMatches, 75 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6855 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 45 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 116 PreInvPairs, 188 NumberOfFragments, 68 HoareAnnotationTreeSize, 116 FomulaSimplifications, 1174 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 872 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1295 NumberOfCodeBlocks, 1231 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1902 ConstructedInterpolants, 0 QuantifiedInterpolants, 4831 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1473 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 6425/10296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-01 12:11:41,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...