/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:02:04,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:02:04,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:02:04,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:02:04,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:02:04,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:02:04,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:02:04,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:02:04,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:02:04,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:02:04,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:02:04,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:02:04,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:02:04,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:02:04,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:02:04,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:02:04,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:02:04,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:02:04,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:02:04,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:02:04,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:02:04,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:02:04,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:02:04,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:02:04,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:02:04,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:02:04,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:02:04,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:02:04,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:02:04,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:02:04,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:02:04,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:02:04,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:02:04,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:02:04,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:02:04,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:02:04,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:02:04,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:02:04,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:02:04,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:02:04,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:02:04,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:02:04,420 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:02:04,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:02:04,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:02:04,421 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:02:04,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:02:04,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:02:04,422 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:02:04,422 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:02:04,423 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:02:04,423 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:02:04,424 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:02:04,424 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:02:04,425 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:02:04,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:02:04,425 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:02:04,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:02:04,426 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:02:04,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:02:04,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:02:04,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:02:04,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:04,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:02:04,427 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:02:04,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:02:04,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:02:04,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:02:04,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:02:04,697 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:02:04,697 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:02:04,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_15-2.c [2023-04-01 00:02:05,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:02:06,015 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:02:06,015 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_15-2.c [2023-04-01 00:02:06,020 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7445a9d5/6575d9e9c5a04333b3cd1293c810e15f/FLAG2c3f27e8e [2023-04-01 00:02:06,037 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7445a9d5/6575d9e9c5a04333b3cd1293c810e15f [2023-04-01 00:02:06,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:02:06,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:02:06,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:06,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:02:06,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:02:06,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ba4d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06, skipping insertion in model container [2023-04-01 00:02:06,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:02:06,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:02:06,212 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_15-2.c[950,963] [2023-04-01 00:02:06,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:06,227 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:02:06,243 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_15-2.c[950,963] [2023-04-01 00:02:06,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:06,256 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:02:06,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06 WrapperNode [2023-04-01 00:02:06,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:06,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:02:06,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:02:06,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:02:06,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,295 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:02:06,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:02:06,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:02:06,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:02:06,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (1/1) ... [2023-04-01 00:02:06,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:06,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 00:02:06,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 00:02:06,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:02:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:02:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:02:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-01 00:02:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-01 00:02:06,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:02:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:02:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:02:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:02:06,381 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:02:06,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:02:06,441 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:02:06,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:02:06,549 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:02:06,564 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:02:06,564 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:02:06,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:06 BoogieIcfgContainer [2023-04-01 00:02:06,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:02:06,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:02:06,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:02:06,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:02:06,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:02:06" (1/3) ... [2023-04-01 00:02:06,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ddd973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:06, skipping insertion in model container [2023-04-01 00:02:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:06" (2/3) ... [2023-04-01 00:02:06,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ddd973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:06, skipping insertion in model container [2023-04-01 00:02:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:06" (3/3) ... [2023-04-01 00:02:06,575 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_15-2.c [2023-04-01 00:02:06,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:02:06,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:02:06,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:02:06,671 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;@8fc3738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:02:06,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:02:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 00:02:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 00:02:06,689 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:06,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:06,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:06,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-01 00:02:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062643904] [2023-04-01 00:02:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:02:06,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062643904] [2023-04-01 00:02:06,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062643904] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:06,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:06,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561687238] [2023-04-01 00:02:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:06,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:07,004 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:07,107 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-04-01 00:02:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-01 00:02:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:07,116 INFO L225 Difference]: With dead ends: 42 [2023-04-01 00:02:07,116 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 00:02:07,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:02:07,122 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:07,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 00:02:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 00:02:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:02:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:07,164 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-01 00:02:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:07,166 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:07,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 00:02:07,167 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:07,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:02:07,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:07,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:07,170 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-01 00:02:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:07,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078002947] [2023-04-01 00:02:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:02:07,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078002947] [2023-04-01 00:02:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078002947] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946388353] [2023-04-01 00:02:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:07,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:07,275 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:07,351 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-01 00:02:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-04-01 00:02:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:07,355 INFO L225 Difference]: With dead ends: 36 [2023-04-01 00:02:07,355 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 00:02:07,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:02:07,363 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:07,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:02:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 00:02:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 00:02:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:02:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:07,389 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-01 00:02:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:07,390 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:07,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 00:02:07,391 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:07,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:07,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:02:07,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:07,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-01 00:02:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:07,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247404087] [2023-04-01 00:02:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:07,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:07,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:07,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247404087] [2023-04-01 00:02:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247404087] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969029974] [2023-04-01 00:02:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:07,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:07,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:02:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:07,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:02:07,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:07,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969029974] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [568366598] [2023-04-01 00:02:08,006 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:02:08,007 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:08,012 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:02:08,017 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:02:08,017 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:02:08,106 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-04-01 00:02:08,201 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 11 for LOIs [2023-04-01 00:02:08,226 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 11 for LOIs [2023-04-01 00:02:08,232 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 00:02:08,244 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:02:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [568366598] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:08,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:08,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 7, 7] total 20 [2023-04-01 00:02:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826259286] [2023-04-01 00:02:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:08,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 00:02:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:08,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 00:02:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:08,427 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:09,030 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-01 00:02:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:02:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-01 00:02:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:09,031 INFO L225 Difference]: With dead ends: 72 [2023-04-01 00:02:09,032 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 00:02:09,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:09,033 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:09,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 00:02:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-01 00:02:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 00:02:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-01 00:02:09,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-01 00:02:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:09,047 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-01 00:02:09,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-01 00:02:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:02:09,049 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:09,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:09,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:09,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:09,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:09,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-01 00:02:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028585764] [2023-04-01 00:02:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:02:09,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028585764] [2023-04-01 00:02:09,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028585764] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198696509] [2023-04-01 00:02:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:09,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:09,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:02:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:09,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:09,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:02:09,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:02:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198696509] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [6452891] [2023-04-01 00:02:09,810 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:09,810 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:09,811 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:09,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-01 00:02:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557395055] [2023-04-01 00:02:09,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:09,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 00:02:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 00:02:09,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:02:09,815 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:10,011 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-01 00:02:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:02:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2023-04-01 00:02:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:10,017 INFO L225 Difference]: With dead ends: 89 [2023-04-01 00:02:10,017 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 00:02:10,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:10,024 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:10,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 00:02:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-01 00:02:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 00:02:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-01 00:02:10,049 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-01 00:02:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-01 00:02:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-01 00:02:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:02:10,057 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:10,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:10,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:10,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 00:02:10,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:10,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-01 00:02:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:10,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8136140] [2023-04-01 00:02:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:02:10,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8136140] [2023-04-01 00:02:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8136140] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218495828] [2023-04-01 00:02:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:10,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:10,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:02:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:10,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:10,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:02:10,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:02:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218495828] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:10,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [168053487] [2023-04-01 00:02:10,797 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:10,797 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:10,798 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:10,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-04-01 00:02:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41291481] [2023-04-01 00:02:10,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:10,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:10,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:10,804 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:11,223 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-01 00:02:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 00:02:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2023-04-01 00:02:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:11,229 INFO L225 Difference]: With dead ends: 125 [2023-04-01 00:02:11,230 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 00:02:11,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:02:11,233 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:11,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 247 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 00:02:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-01 00:02:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2023-04-01 00:02:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-01 00:02:11,252 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-01 00:02:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:11,255 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-01 00:02:11,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-01 00:02:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 00:02:11,260 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:11,260 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:11,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:11,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:11,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:11,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-01 00:02:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283993477] [2023-04-01 00:02:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:02:11,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283993477] [2023-04-01 00:02:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283993477] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326981045] [2023-04-01 00:02:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:11,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:11,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:11,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:11,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 00:02:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:11,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:02:11,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 00:02:11,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 00:02:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326981045] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077435215] [2023-04-01 00:02:12,149 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:12,150 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:12,150 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:12,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2023-04-01 00:02:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971713726] [2023-04-01 00:02:12,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:12,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:02:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:02:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:02:12,152 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:12,352 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-04-01 00:02:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 00:02:12,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 54 [2023-04-01 00:02:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:12,357 INFO L225 Difference]: With dead ends: 123 [2023-04-01 00:02:12,357 INFO L226 Difference]: Without dead ends: 101 [2023-04-01 00:02:12,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:02:12,359 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:12,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 117 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-01 00:02:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2023-04-01 00:02:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 12 states have return successors, (40), 18 states have call predecessors, (40), 15 states have call successors, (40) [2023-04-01 00:02:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2023-04-01 00:02:12,392 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 54 [2023-04-01 00:02:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:12,393 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2023-04-01 00:02:12,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2023-04-01 00:02:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-04-01 00:02:12,394 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:12,394 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:12,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 00:02:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:12,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:12,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1187443411, now seen corresponding path program 1 times [2023-04-01 00:02:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083011218] [2023-04-01 00:02:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-04-01 00:02:12,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083011218] [2023-04-01 00:02:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083011218] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114724964] [2023-04-01 00:02:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:12,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:12,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 00:02:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:12,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:12,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-04-01 00:02:13,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-04-01 00:02:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114724964] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949371471] [2023-04-01 00:02:13,790 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:13,790 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:13,791 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:13,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2023-04-01 00:02:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360362894] [2023-04-01 00:02:13,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:13,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:02:13,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:02:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:02:13,794 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-01 00:02:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:14,455 INFO L93 Difference]: Finished difference Result 208 states and 415 transitions. [2023-04-01 00:02:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 00:02:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 96 [2023-04-01 00:02:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:14,458 INFO L225 Difference]: With dead ends: 208 [2023-04-01 00:02:14,458 INFO L226 Difference]: Without dead ends: 119 [2023-04-01 00:02:14,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 00:02:14,459 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 79 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:14,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-04-01 00:02:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2023-04-01 00:02:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 21 states have call successors, (21), 10 states have call predecessors, (21), 15 states have return successors, (51), 24 states have call predecessors, (51), 20 states have call successors, (51) [2023-04-01 00:02:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2023-04-01 00:02:14,486 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 96 [2023-04-01 00:02:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:14,487 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2023-04-01 00:02:14,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-01 00:02:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2023-04-01 00:02:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-04-01 00:02:14,489 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:14,489 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 10, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:14,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:14,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:14,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:14,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1368434034, now seen corresponding path program 2 times [2023-04-01 00:02:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:14,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695219327] [2023-04-01 00:02:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 49 proven. 168 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-04-01 00:02:14,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695219327] [2023-04-01 00:02:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695219327] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221008557] [2023-04-01 00:02:14,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:14,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:14,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 00:02:14,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:14,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:14,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:14,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 38 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-04-01 00:02:15,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-04-01 00:02:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221008557] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [586673469] [2023-04-01 00:02:15,905 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:15,905 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:15,906 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:15,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:15,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 20 [2023-04-01 00:02:15,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548751078] [2023-04-01 00:02:15,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:15,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 00:02:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:15,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 00:02:15,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:15,908 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-01 00:02:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:16,328 INFO L93 Difference]: Finished difference Result 230 states and 413 transitions. [2023-04-01 00:02:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:02:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 188 [2023-04-01 00:02:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:16,331 INFO L225 Difference]: With dead ends: 230 [2023-04-01 00:02:16,331 INFO L226 Difference]: Without dead ends: 128 [2023-04-01 00:02:16,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 358 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 00:02:16,333 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:16,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-04-01 00:02:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2023-04-01 00:02:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 24 states have call successors, (24), 11 states have call predecessors, (24), 17 states have return successors, (56), 27 states have call predecessors, (56), 23 states have call successors, (56) [2023-04-01 00:02:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2023-04-01 00:02:16,352 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 188 [2023-04-01 00:02:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:16,352 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2023-04-01 00:02:16,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-01 00:02:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2023-04-01 00:02:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-04-01 00:02:16,355 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:16,355 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:16,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:16,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:16,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:16,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1236166869, now seen corresponding path program 3 times [2023-04-01 00:02:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:16,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939219707] [2023-04-01 00:02:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 42 proven. 158 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2023-04-01 00:02:16,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939219707] [2023-04-01 00:02:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939219707] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356059739] [2023-04-01 00:02:16,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:16,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:16,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 00:02:16,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:16,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:16,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:16,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 6 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-04-01 00:02:16,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 57 proven. 143 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2023-04-01 00:02:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356059739] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1215400273] [2023-04-01 00:02:17,444 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:17,444 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:17,445 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:17,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-04-01 00:02:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371514614] [2023-04-01 00:02:17,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:17,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:17,447 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2023-04-01 00:02:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:17,887 INFO L93 Difference]: Finished difference Result 248 states and 388 transitions. [2023-04-01 00:02:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 00:02:17,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) Word has length 149 [2023-04-01 00:02:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:17,891 INFO L225 Difference]: With dead ends: 248 [2023-04-01 00:02:17,892 INFO L226 Difference]: Without dead ends: 147 [2023-04-01 00:02:17,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:02:17,895 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 80 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:17,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-04-01 00:02:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2023-04-01 00:02:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 24 states have call successors, (24), 11 states have call predecessors, (24), 15 states have return successors, (51), 26 states have call predecessors, (51), 23 states have call successors, (51) [2023-04-01 00:02:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-04-01 00:02:17,928 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 149 [2023-04-01 00:02:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:17,929 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-04-01 00:02:17,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2023-04-01 00:02:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-04-01 00:02:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-04-01 00:02:17,932 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:17,932 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:17,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:18,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:18,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:18,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1350056611, now seen corresponding path program 4 times [2023-04-01 00:02:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713249173] [2023-04-01 00:02:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 66 proven. 143 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2023-04-01 00:02:18,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:18,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713249173] [2023-04-01 00:02:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713249173] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994597275] [2023-04-01 00:02:18,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:18,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:18,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:18,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:18,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:02:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:18,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:02:18,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 29 proven. 215 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-04-01 00:02:18,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 29 proven. 231 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-04-01 00:02:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994597275] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005521531] [2023-04-01 00:02:19,640 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:19,641 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:19,641 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:19,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2023-04-01 00:02:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125634750] [2023-04-01 00:02:19,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:19,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:02:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:02:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:02:19,644 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:20,325 INFO L93 Difference]: Finished difference Result 265 states and 468 transitions. [2023-04-01 00:02:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 00:02:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) Word has length 150 [2023-04-01 00:02:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:20,329 INFO L225 Difference]: With dead ends: 265 [2023-04-01 00:02:20,329 INFO L226 Difference]: Without dead ends: 139 [2023-04-01 00:02:20,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 281 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 00:02:20,332 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 115 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:20,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 341 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-04-01 00:02:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-04-01 00:02:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 79 states have internal predecessors, (93), 25 states have call successors, (25), 13 states have call predecessors, (25), 16 states have return successors, (57), 26 states have call predecessors, (57), 24 states have call successors, (57) [2023-04-01 00:02:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2023-04-01 00:02:20,349 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 150 [2023-04-01 00:02:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:20,349 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2023-04-01 00:02:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.608695652173913) internal successors, (83), 25 states have internal predecessors, (83), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2023-04-01 00:02:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-04-01 00:02:20,352 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:20,352 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:20,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:20,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 00:02:20,559 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:20,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1253428981, now seen corresponding path program 5 times [2023-04-01 00:02:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912094255] [2023-04-01 00:02:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 114 proven. 204 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2023-04-01 00:02:20,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912094255] [2023-04-01 00:02:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912094255] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354850089] [2023-04-01 00:02:20,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:20,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:20,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:20,759 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:20,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:02:20,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:20,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:20,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:02:20,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 214 proven. 45 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2023-04-01 00:02:20,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 216 proven. 48 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2023-04-01 00:02:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354850089] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:21,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [420840978] [2023-04-01 00:02:21,558 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:21,558 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:21,559 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:21,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2023-04-01 00:02:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88115393] [2023-04-01 00:02:21,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:21,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:21,562 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2023-04-01 00:02:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:21,765 INFO L93 Difference]: Finished difference Result 149 states and 238 transitions. [2023-04-01 00:02:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:02:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 204 [2023-04-01 00:02:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:21,768 INFO L225 Difference]: With dead ends: 149 [2023-04-01 00:02:21,768 INFO L226 Difference]: Without dead ends: 135 [2023-04-01 00:02:21,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:21,770 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:21,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-04-01 00:02:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-04-01 00:02:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 83 states have internal predecessors, (97), 25 states have call successors, (25), 13 states have call predecessors, (25), 18 states have return successors, (62), 28 states have call predecessors, (62), 24 states have call successors, (62) [2023-04-01 00:02:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 184 transitions. [2023-04-01 00:02:21,790 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 184 transitions. Word has length 204 [2023-04-01 00:02:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:21,791 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 184 transitions. [2023-04-01 00:02:21,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2023-04-01 00:02:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 184 transitions. [2023-04-01 00:02:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2023-04-01 00:02:21,796 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:21,797 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 28, 28, 23, 22, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 8, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:21,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:22,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:22,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:22,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1542733613, now seen corresponding path program 6 times [2023-04-01 00:02:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178870912] [2023-04-01 00:02:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 128 proven. 830 refuted. 0 times theorem prover too weak. 3390 trivial. 0 not checked. [2023-04-01 00:02:22,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178870912] [2023-04-01 00:02:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178870912] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943291993] [2023-04-01 00:02:22,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:22,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:22,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:02:22,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:22,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:22,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:02:22,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 2437 proven. 449 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2023-04-01 00:02:22,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 354 proven. 1151 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2023-04-01 00:02:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943291993] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:25,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [221671860] [2023-04-01 00:02:25,306 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:25,306 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:25,306 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:25,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 23] total 30 [2023-04-01 00:02:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352821360] [2023-04-01 00:02:25,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:25,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-04-01 00:02:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-04-01 00:02:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2023-04-01 00:02:25,311 INFO L87 Difference]: Start difference. First operand 125 states and 184 transitions. Second operand has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) [2023-04-01 00:02:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:26,236 INFO L93 Difference]: Finished difference Result 298 states and 572 transitions. [2023-04-01 00:02:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-01 00:02:26,236 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) Word has length 394 [2023-04-01 00:02:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:26,239 INFO L225 Difference]: With dead ends: 298 [2023-04-01 00:02:26,239 INFO L226 Difference]: Without dead ends: 176 [2023-04-01 00:02:26,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 765 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=501, Invalid=2691, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 00:02:26,241 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 167 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:26,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 361 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:02:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-04-01 00:02:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2023-04-01 00:02:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 111 states have internal predecessors, (130), 34 states have call successors, (34), 23 states have call predecessors, (34), 19 states have return successors, (90), 31 states have call predecessors, (90), 33 states have call successors, (90) [2023-04-01 00:02:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 254 transitions. [2023-04-01 00:02:26,265 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 254 transitions. Word has length 394 [2023-04-01 00:02:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:26,265 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 254 transitions. [2023-04-01 00:02:26,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 30 states have internal predecessors, (117), 27 states have call successors, (38), 2 states have call predecessors, (38), 14 states have return successors, (45), 14 states have call predecessors, (45), 27 states have call successors, (45) [2023-04-01 00:02:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 254 transitions. [2023-04-01 00:02:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-04-01 00:02:26,270 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:26,270 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 20, 19, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:26,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 00:02:26,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:26,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2046274499, now seen corresponding path program 7 times [2023-04-01 00:02:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:26,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894362390] [2023-04-01 00:02:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 191 proven. 507 refuted. 0 times theorem prover too weak. 2495 trivial. 0 not checked. [2023-04-01 00:02:26,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:26,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894362390] [2023-04-01 00:02:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894362390] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039037232] [2023-04-01 00:02:26,825 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:26,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:26,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:26,826 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:26,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:02:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:27,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 00:02:27,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 137 proven. 766 refuted. 0 times theorem prover too weak. 2290 trivial. 0 not checked. [2023-04-01 00:02:27,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 137 proven. 799 refuted. 0 times theorem prover too weak. 2257 trivial. 0 not checked. [2023-04-01 00:02:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039037232] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145862974] [2023-04-01 00:02:29,490 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:29,490 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:29,491 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:29,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 19] total 26 [2023-04-01 00:02:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290159786] [2023-04-01 00:02:29,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:29,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-01 00:02:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-01 00:02:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:29,493 INFO L87 Difference]: Start difference. First operand 166 states and 254 transitions. Second operand has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-04-01 00:02:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:29,816 INFO L93 Difference]: Finished difference Result 218 states and 389 transitions. [2023-04-01 00:02:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:02:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 340 [2023-04-01 00:02:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:29,820 INFO L225 Difference]: With dead ends: 218 [2023-04-01 00:02:29,820 INFO L226 Difference]: Without dead ends: 194 [2023-04-01 00:02:29,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 662 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 00:02:29,822 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 89 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:29,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 199 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-04-01 00:02:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2023-04-01 00:02:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.15) internal successors, (138), 119 states have internal predecessors, (138), 36 states have call successors, (36), 23 states have call predecessors, (36), 22 states have return successors, (105), 36 states have call predecessors, (105), 35 states have call successors, (105) [2023-04-01 00:02:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2023-04-01 00:02:29,854 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 340 [2023-04-01 00:02:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:29,854 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2023-04-01 00:02:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.625) internal successors, (87), 26 states have internal predecessors, (87), 22 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-04-01 00:02:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2023-04-01 00:02:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2023-04-01 00:02:29,864 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:29,864 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 76, 76, 63, 60, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 25, 22, 16, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:29,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:30,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 00:02:30,071 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:30,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 698197447, now seen corresponding path program 8 times [2023-04-01 00:02:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:30,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153500812] [2023-04-01 00:02:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 32451 backedges. 622 proven. 2593 refuted. 0 times theorem prover too weak. 29236 trivial. 0 not checked. [2023-04-01 00:02:31,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153500812] [2023-04-01 00:02:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153500812] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132903310] [2023-04-01 00:02:31,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:31,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:31,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:31,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 00:02:31,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-04-01 00:02:31,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:31,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:02:31,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32451 backedges. 2803 proven. 78 refuted. 0 times theorem prover too weak. 29570 trivial. 0 not checked. [2023-04-01 00:02:31,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32451 backedges. 2803 proven. 83 refuted. 0 times theorem prover too weak. 29565 trivial. 0 not checked. [2023-04-01 00:02:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132903310] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [83761654] [2023-04-01 00:02:34,648 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:34,648 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:34,648 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:34,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 28 [2023-04-01 00:02:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472912156] [2023-04-01 00:02:34,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:34,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-04-01 00:02:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-04-01 00:02:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2023-04-01 00:02:34,654 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 19 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (38), 18 states have call predecessors, (38), 19 states have call successors, (38) [2023-04-01 00:02:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:35,611 INFO L93 Difference]: Finished difference Result 508 states and 1006 transitions. [2023-04-01 00:02:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-01 00:02:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 19 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (38), 18 states have call predecessors, (38), 19 states have call successors, (38) Word has length 1048 [2023-04-01 00:02:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:35,616 INFO L225 Difference]: With dead ends: 508 [2023-04-01 00:02:35,617 INFO L226 Difference]: Without dead ends: 325 [2023-04-01 00:02:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2147 GetRequests, 2081 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=3124, Unknown=0, NotChecked=0, Total=3660 [2023-04-01 00:02:35,620 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 175 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 331 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:02:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-04-01 00:02:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 252. [2023-04-01 00:02:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 172 states have (on average 1.1511627906976745) internal successors, (198), 170 states have internal predecessors, (198), 54 states have call successors, (54), 37 states have call predecessors, (54), 25 states have return successors, (197), 44 states have call predecessors, (197), 53 states have call successors, (197) [2023-04-01 00:02:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 449 transitions. [2023-04-01 00:02:35,691 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 449 transitions. Word has length 1048 [2023-04-01 00:02:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:35,692 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 449 transitions. [2023-04-01 00:02:35,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 19 states have call successors, (29), 1 states have call predecessors, (29), 16 states have return successors, (38), 18 states have call predecessors, (38), 19 states have call successors, (38) [2023-04-01 00:02:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 449 transitions. [2023-04-01 00:02:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2023-04-01 00:02:35,709 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:35,710 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 86, 86, 71, 70, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 28, 26, 18, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:35,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:35,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 00:02:35,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:35,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 739822774, now seen corresponding path program 9 times [2023-04-01 00:02:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092509349] [2023-04-01 00:02:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 42580 backedges. 670 proven. 2574 refuted. 0 times theorem prover too weak. 39336 trivial. 0 not checked. [2023-04-01 00:02:37,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092509349] [2023-04-01 00:02:37,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092509349] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835612660] [2023-04-01 00:02:37,246 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:37,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:37,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 00:02:37,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:37,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:37,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 2137 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 00:02:37,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 42580 backedges. 13207 proven. 331 refuted. 0 times theorem prover too weak. 29042 trivial. 0 not checked. [2023-04-01 00:02:37,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 42580 backedges. 753 proven. 4407 refuted. 0 times theorem prover too weak. 37420 trivial. 0 not checked. [2023-04-01 00:02:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835612660] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646696587] [2023-04-01 00:02:42,249 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:42,249 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:42,249 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:42,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 21] total 32 [2023-04-01 00:02:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767937549] [2023-04-01 00:02:42,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:42,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 00:02:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 00:02:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:02:42,255 INFO L87 Difference]: Start difference. First operand 252 states and 449 transitions. Second operand has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 27 states have call successors, (39), 2 states have call predecessors, (39), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) [2023-04-01 00:02:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:43,479 INFO L93 Difference]: Finished difference Result 613 states and 1252 transitions. [2023-04-01 00:02:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-04-01 00:02:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 27 states have call successors, (39), 2 states have call predecessors, (39), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) Word has length 1198 [2023-04-01 00:02:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:43,485 INFO L225 Difference]: With dead ends: 613 [2023-04-01 00:02:43,486 INFO L226 Difference]: Without dead ends: 337 [2023-04-01 00:02:43,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2449 GetRequests, 2374 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=653, Invalid=4039, Unknown=0, NotChecked=0, Total=4692 [2023-04-01 00:02:43,491 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 159 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:43,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 545 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-01 00:02:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-04-01 00:02:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 298. [2023-04-01 00:02:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 207 states have (on average 1.1111111111111112) internal successors, (230), 202 states have internal predecessors, (230), 65 states have call successors, (65), 49 states have call predecessors, (65), 25 states have return successors, (191), 46 states have call predecessors, (191), 64 states have call successors, (191) [2023-04-01 00:02:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 486 transitions. [2023-04-01 00:02:43,537 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 486 transitions. Word has length 1198 [2023-04-01 00:02:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:43,538 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 486 transitions. [2023-04-01 00:02:43,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 27 states have call successors, (39), 2 states have call predecessors, (39), 16 states have return successors, (49), 17 states have call predecessors, (49), 27 states have call successors, (49) [2023-04-01 00:02:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 486 transitions. [2023-04-01 00:02:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2023-04-01 00:02:43,548 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:43,548 INFO L195 NwaCegarLoop]: trace histogram [74, 74, 71, 71, 59, 58, 37, 37, 37, 37, 37, 37, 37, 35, 35, 35, 35, 35, 35, 35, 24, 21, 15, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:43,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 00:02:43,757 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:43,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash 832990363, now seen corresponding path program 10 times [2023-04-01 00:02:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715351905] [2023-04-01 00:02:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 1012 proven. 2031 refuted. 0 times theorem prover too weak. 26109 trivial. 0 not checked. [2023-04-01 00:02:44,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715351905] [2023-04-01 00:02:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715351905] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557583197] [2023-04-01 00:02:44,893 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:44,894 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:44,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 00:02:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:45,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 2236 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:02:45,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 515 proven. 3269 refuted. 0 times theorem prover too weak. 25368 trivial. 0 not checked. [2023-04-01 00:02:45,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29152 backedges. 515 proven. 3325 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2023-04-01 00:02:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557583197] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [189828774] [2023-04-01 00:02:50,022 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:50,022 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:50,022 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:02:50,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 23] total 29 [2023-04-01 00:02:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654948865] [2023-04-01 00:02:50,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:50,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 00:02:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 00:02:50,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:02:50,026 INFO L87 Difference]: Start difference. First operand 298 states and 486 transitions. Second operand has 29 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 29 states have internal predecessors, (96), 25 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (41), 15 states have call predecessors, (41), 25 states have call successors, (41) [2023-04-01 00:02:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:50,402 INFO L93 Difference]: Finished difference Result 358 states and 670 transitions. [2023-04-01 00:02:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 00:02:50,402 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 29 states have internal predecessors, (96), 25 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (41), 15 states have call predecessors, (41), 25 states have call successors, (41) Word has length 994 [2023-04-01 00:02:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:50,409 INFO L225 Difference]: With dead ends: 358 [2023-04-01 00:02:50,409 INFO L226 Difference]: Without dead ends: 334 [2023-04-01 00:02:50,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2019 GetRequests, 1969 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2023-04-01 00:02:50,411 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 74 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 253 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-04-01 00:02:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 317. [2023-04-01 00:02:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 219 states have (on average 1.1050228310502284) internal successors, (242), 214 states have internal predecessors, (242), 67 states have call successors, (67), 49 states have call predecessors, (67), 30 states have return successors, (226), 53 states have call predecessors, (226), 66 states have call successors, (226) [2023-04-01 00:02:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 535 transitions. [2023-04-01 00:02:50,459 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 535 transitions. Word has length 994 [2023-04-01 00:02:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:50,460 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 535 transitions. [2023-04-01 00:02:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 29 states have internal predecessors, (96), 25 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (41), 15 states have call predecessors, (41), 25 states have call successors, (41) [2023-04-01 00:02:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 535 transitions. [2023-04-01 00:02:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2057 [2023-04-01 00:02:50,489 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:50,489 INFO L195 NwaCegarLoop]: trace histogram [154, 154, 147, 147, 123, 120, 77, 77, 77, 77, 77, 77, 77, 73, 73, 73, 73, 73, 73, 73, 47, 46, 34, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:50,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:50,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:50,701 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:50,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1690165523, now seen corresponding path program 11 times [2023-04-01 00:02:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392326687] [2023-04-01 00:02:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 126907 backedges. 2973 proven. 4351 refuted. 0 times theorem prover too weak. 119583 trivial. 0 not checked. [2023-04-01 00:02:53,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392326687] [2023-04-01 00:02:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392326687] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055729042] [2023-04-01 00:02:53,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:53,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:53,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:53,510 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:53,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 00:02:53,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2023-04-01 00:02:53,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:53,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 00:02:53,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 126907 backedges. 7097 proven. 354 refuted. 0 times theorem prover too weak. 119456 trivial. 0 not checked. [2023-04-01 00:02:54,121 INFO L327 TraceCheckSpWp]: Computing backward predicates...