/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive/recHanoi01.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:11:51,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:11:51,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:11:51,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:11:51,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:11:51,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:11:51,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:11:51,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:11:51,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:11:51,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:11:51,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:11:51,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:11:51,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:11:51,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:11:51,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:11:51,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:11:51,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:11:51,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:11:51,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:11:51,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:11:51,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:11:51,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:11:51,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:11:51,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:11:51,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:11:51,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:11:51,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:11:51,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:11:51,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:11:51,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:11:51,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:11:51,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:11:51,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:11:51,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:11:51,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:11:51,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:11:51,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:11:51,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:11:51,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:11:51,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:11:51,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:11:51,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-03 01:11:51,276 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:11:51,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:11:51,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:11:51,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:11:51,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:11:51,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:11:51,277 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:11:51,278 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:11:51,278 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:11:51,278 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:11:51,278 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:11:51,278 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:11:51,279 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:11:51,279 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:11:51,279 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:11:51,279 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:11:51,279 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:11:51,279 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:11:51,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:11:51,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:11:51,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:11:51,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:11:51,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:11:51,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:11:51,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-03 01:11:51,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:11:51,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:11:51,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:11:51,531 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:11:51,532 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:11:51,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi01.c [2023-04-03 01:11:52,750 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:11:52,877 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:11:52,877 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi01.c [2023-04-03 01:11:52,886 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ed7f5d5/d9df98afe3a44412aec3614076c1ed4d/FLAGc20eff3fc [2023-04-03 01:11:53,288 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27ed7f5d5/d9df98afe3a44412aec3614076c1ed4d [2023-04-03 01:11:53,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:11:53,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:11:53,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:11:53,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:11:53,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:11:53,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd6853d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53, skipping insertion in model container [2023-04-03 01:11:53,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:11:53,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:11:53,427 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/recHanoi01.c[1213,1226] [2023-04-03 01:11:53,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:11:53,436 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:11:53,466 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/recHanoi01.c[1213,1226] [2023-04-03 01:11:53,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:11:53,482 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:11:53,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53 WrapperNode [2023-04-03 01:11:53,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:11:53,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:11:53,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:11:53,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:11:53,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,498 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:11:53,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:11:53,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:11:53,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:11:53,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (1/1) ... [2023-04-03 01:11:53,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:11:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:53,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-03 01:11:53,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-03 01:11:53,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:11:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:11:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:11:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-04-03 01:11:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure applyHanoi [2023-04-03 01:11:53,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-04-03 01:11:53,549 INFO L130 BoogieDeclarations]: Found specification of procedure applyHanoi [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:11:53,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:11:53,596 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:11:53,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:11:53,690 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:11:53,701 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:11:53,701 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-03 01:11:53,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:11:53 BoogieIcfgContainer [2023-04-03 01:11:53,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:11:53,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:11:53,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:11:53,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:11:53,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:11:53" (1/3) ... [2023-04-03 01:11:53,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf8e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:11:53, skipping insertion in model container [2023-04-03 01:11:53,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:53" (2/3) ... [2023-04-03 01:11:53,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf8e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:11:53, skipping insertion in model container [2023-04-03 01:11:53,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:11:53" (3/3) ... [2023-04-03 01:11:53,708 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi01.c [2023-04-03 01:11:53,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:11:53,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:11:53,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:11:53,759 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;@39ccea38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:11:53,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:11:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-03 01:11:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-03 01:11:53,768 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:53,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:53,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:53,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:53,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2113157996, now seen corresponding path program 1 times [2023-04-03 01:11:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:53,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130199480] [2023-04-03 01:11:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:11:53,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130199480] [2023-04-03 01:11:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130199480] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:11:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:11:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:11:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982823035] [2023-04-03 01:11:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:11:53,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:11:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:11:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:11:54,026 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 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 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-03 01:11:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:54,140 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2023-04-03 01:11:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:11:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-03 01:11:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:54,148 INFO L225 Difference]: With dead ends: 47 [2023-04-03 01:11:54,148 INFO L226 Difference]: Without dead ends: 26 [2023-04-03 01:11:54,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:11:54,157 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:54,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-04-03 01:11:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-04-03 01:11:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-03 01:11:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-04-03 01:11:54,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2023-04-03 01:11:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:54,183 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-04-03 01:11:54,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-03 01:11:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-04-03 01:11:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-03 01:11:54,185 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:54,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:54,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:11:54,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:54,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1699220345, now seen corresponding path program 1 times [2023-04-03 01:11:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294678872] [2023-04-03 01:11:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:11:54,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294678872] [2023-04-03 01:11:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294678872] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:54,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103060345] [2023-04-03 01:11:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:54,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:54,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-03 01:11:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:54,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-03 01:11:54,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-03 01:11:54,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:11:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103060345] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [380596713] [2023-04-03 01:11:55,039 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:11:55,040 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:55,043 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:55,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:55,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2023-04-03 01:11:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800763064] [2023-04-03 01:11:55,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:55,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-03 01:11:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:55,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-03 01:11:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:11:55,048 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-03 01:11:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:55,412 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2023-04-03 01:11:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-03 01:11:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 29 [2023-04-03 01:11:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:55,418 INFO L225 Difference]: With dead ends: 77 [2023-04-03 01:11:55,418 INFO L226 Difference]: Without dead ends: 71 [2023-04-03 01:11:55,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2023-04-03 01:11:55,420 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:55,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 124 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:11:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-03 01:11:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-04-03 01:11:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (34), 17 states have call predecessors, (34), 15 states have call successors, (34) [2023-04-03 01:11:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2023-04-03 01:11:55,438 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 29 [2023-04-03 01:11:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:55,439 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2023-04-03 01:11:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-03 01:11:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2023-04-03 01:11:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-03 01:11:55,441 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:55,441 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:55,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:55,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:55,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:55,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1993519074, now seen corresponding path program 2 times [2023-04-03 01:11:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420108096] [2023-04-03 01:11:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-03 01:11:55,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420108096] [2023-04-03 01:11:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420108096] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636739453] [2023-04-03 01:11:55,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:11:55,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:55,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:55,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:55,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-03 01:11:55,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-03 01:11:55,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:55,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:11:55,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-03 01:11:55,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-03 01:11:56,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636739453] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:56,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248721789] [2023-04-03 01:11:56,121 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:11:56,121 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:56,121 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:56,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2023-04-03 01:11:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619194674] [2023-04-03 01:11:56,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:56,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-03 01:11:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-03 01:11:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-04-03 01:11:56,124 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-04-03 01:11:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:56,318 INFO L93 Difference]: Finished difference Result 111 states and 172 transitions. [2023-04-03 01:11:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-03 01:11:56,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) Word has length 39 [2023-04-03 01:11:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:56,320 INFO L225 Difference]: With dead ends: 111 [2023-04-03 01:11:56,320 INFO L226 Difference]: Without dead ends: 77 [2023-04-03 01:11:56,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-04-03 01:11:56,321 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:56,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-04-03 01:11:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2023-04-03 01:11:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-03 01:11:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-04-03 01:11:56,330 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2023-04-03 01:11:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:56,330 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-04-03 01:11:56,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2023-04-03 01:11:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-04-03 01:11:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-04-03 01:11:56,331 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:56,331 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] [2023-04-03 01:11:56,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-03 01:11:56,537 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,SelfDestructingSolverStorable2 [2023-04-03 01:11:56,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:56,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 317444017, now seen corresponding path program 1 times [2023-04-03 01:11:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217152660] [2023-04-03 01:11:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-03 01:11:56,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:56,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217152660] [2023-04-03 01:11:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217152660] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313955827] [2023-04-03 01:11:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:56,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:56,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-03 01:11:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:56,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:11:56,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-03 01:11:56,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:11:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313955827] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416221197] [2023-04-03 01:11:56,888 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:11:56,888 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:56,888 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:56,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2023-04-03 01:11:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846594262] [2023-04-03 01:11:56,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:56,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-03 01:11:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-03 01:11:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:11:56,890 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-03 01:11:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:56,992 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2023-04-03 01:11:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:11:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-04-03 01:11:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:56,993 INFO L225 Difference]: With dead ends: 65 [2023-04-03 01:11:56,993 INFO L226 Difference]: Without dead ends: 53 [2023-04-03 01:11:56,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:11:56,994 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:56,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-03 01:11:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-04-03 01:11:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-04-03 01:11:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-04-03 01:11:57,001 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 35 [2023-04-03 01:11:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:57,001 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-04-03 01:11:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-03 01:11:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-04-03 01:11:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-03 01:11:57,002 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:57,003 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:57,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-03 01:11:57,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:57,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:57,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1894273327, now seen corresponding path program 2 times [2023-04-03 01:11:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:57,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315765753] [2023-04-03 01:11:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-03 01:11:57,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315765753] [2023-04-03 01:11:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315765753] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:57,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106860520] [2023-04-03 01:11:57,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:11:57,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:57,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:57,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:57,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-03 01:11:57,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-03 01:11:57,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:57,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 47 conjunts are in the unsatisfiable core [2023-04-03 01:11:57,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-03 01:11:57,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-03 01:11:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106860520] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:58,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356720234] [2023-04-03 01:11:58,368 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:11:58,368 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:58,368 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:58,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 18] total 32 [2023-04-03 01:11:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276424409] [2023-04-03 01:11:58,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:58,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-03 01:11:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-03 01:11:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2023-04-03 01:11:58,372 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) [2023-04-03 01:11:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:59,157 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2023-04-03 01:11:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-04-03 01:11:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) Word has length 55 [2023-04-03 01:11:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:59,159 INFO L225 Difference]: With dead ends: 104 [2023-04-03 01:11:59,159 INFO L226 Difference]: Without dead ends: 100 [2023-04-03 01:11:59,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 96 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=478, Invalid=2828, Unknown=0, NotChecked=0, Total=3306 [2023-04-03 01:11:59,161 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 164 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:59,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 159 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:11:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-04-03 01:11:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2023-04-03 01:11:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 20 states have call successors, (20), 12 states have call predecessors, (20), 17 states have return successors, (45), 25 states have call predecessors, (45), 19 states have call successors, (45) [2023-04-03 01:11:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2023-04-03 01:11:59,177 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 55 [2023-04-03 01:11:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:59,178 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2023-04-03 01:11:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (22), 8 states have call predecessors, (22), 15 states have return successors, (22), 14 states have call predecessors, (22), 10 states have call successors, (22) [2023-04-03 01:11:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2023-04-03 01:11:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-03 01:11:59,181 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:59,181 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:59,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:59,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:59,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1176359335, now seen corresponding path program 3 times [2023-04-03 01:11:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371942894] [2023-04-03 01:11:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 43 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-04-03 01:11:59,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371942894] [2023-04-03 01:11:59,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371942894] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016596471] [2023-04-03 01:11:59,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:11:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:59,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:59,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-03 01:11:59,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:11:59,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:59,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:11:59,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 37 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-04-03 01:11:59,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-04-03 01:12:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016596471] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101196100] [2023-04-03 01:12:00,129 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:00,130 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:00,130 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:00,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 19 [2023-04-03 01:12:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137791884] [2023-04-03 01:12:00,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-03 01:12:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-03 01:12:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:12:00,132 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) [2023-04-03 01:12:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:00,272 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2023-04-03 01:12:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-03 01:12:00,278 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) Word has length 61 [2023-04-03 01:12:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:00,280 INFO L225 Difference]: With dead ends: 129 [2023-04-03 01:12:00,280 INFO L226 Difference]: Without dead ends: 111 [2023-04-03 01:12:00,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2023-04-03 01:12:00,281 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:00,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 119 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:12:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-03 01:12:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2023-04-03 01:12:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (63), 35 states have call predecessors, (63), 27 states have call successors, (63) [2023-04-03 01:12:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2023-04-03 01:12:00,303 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 61 [2023-04-03 01:12:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:00,303 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2023-04-03 01:12:00,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 7 states have call predecessors, (17), 12 states have call successors, (17) [2023-04-03 01:12:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2023-04-03 01:12:00,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-03 01:12:00,305 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:00,312 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:00,316 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-03 01:12:00,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:00,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:00,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash 92646097, now seen corresponding path program 4 times [2023-04-03 01:12:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603600435] [2023-04-03 01:12:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 125 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-04-03 01:12:00,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603600435] [2023-04-03 01:12:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603600435] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437883347] [2023-04-03 01:12:00,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:12:00,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:00,713 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:12:00,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-03 01:12:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:00,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:12:00,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 125 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-04-03 01:12:00,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 48 proven. 135 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2023-04-03 01:12:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437883347] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [696041027] [2023-04-03 01:12:01,312 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:01,312 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:01,313 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:01,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:01,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2023-04-03 01:12:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033728143] [2023-04-03 01:12:01,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:01,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-03 01:12:01,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-03 01:12:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:12:01,314 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-03 01:12:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:01,447 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2023-04-03 01:12:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:12:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) Word has length 95 [2023-04-03 01:12:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:01,448 INFO L225 Difference]: With dead ends: 113 [2023-04-03 01:12:01,448 INFO L226 Difference]: Without dead ends: 90 [2023-04-03 01:12:01,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:12:01,449 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:01,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:12:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-04-03 01:12:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-04-03 01:12:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 22 states have call successors, (22), 12 states have call predecessors, (22), 14 states have return successors, (41), 25 states have call predecessors, (41), 21 states have call successors, (41) [2023-04-03 01:12:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2023-04-03 01:12:01,458 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 95 [2023-04-03 01:12:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:01,459 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2023-04-03 01:12:01,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (16), 7 states have call predecessors, (16), 11 states have call successors, (16) [2023-04-03 01:12:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2023-04-03 01:12:01,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-04-03 01:12:01,460 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:01,460 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:01,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-03 01:12:01,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:01,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:01,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1931269543, now seen corresponding path program 5 times [2023-04-03 01:12:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728013951] [2023-04-03 01:12:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 34 proven. 161 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2023-04-03 01:12:02,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728013951] [2023-04-03 01:12:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728013951] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771137642] [2023-04-03 01:12:02,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:12:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:02,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:12:02,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-03 01:12:02,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-03 01:12:02,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:02,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2023-04-03 01:12:02,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2023-04-03 01:12:02,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-03 01:12:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771137642] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [497259118] [2023-04-03 01:12:04,140 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:04,140 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:04,140 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:04,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 32] total 51 [2023-04-03 01:12:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222536448] [2023-04-03 01:12:04,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-03 01:12:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-03 01:12:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2365, Unknown=0, NotChecked=0, Total=2550 [2023-04-03 01:12:04,143 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) [2023-04-03 01:12:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:08,213 INFO L93 Difference]: Finished difference Result 341 states and 595 transitions. [2023-04-03 01:12:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-04-03 01:12:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) Word has length 101 [2023-04-03 01:12:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:08,221 INFO L225 Difference]: With dead ends: 341 [2023-04-03 01:12:08,221 INFO L226 Difference]: Without dead ends: 337 [2023-04-03 01:12:08,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 187 SyntacticMatches, 14 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3872 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1893, Invalid=12149, Unknown=0, NotChecked=0, Total=14042 [2023-04-03 01:12:08,230 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 511 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:08,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 345 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [945 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-03 01:12:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-04-03 01:12:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 245. [2023-04-03 01:12:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 123 states have (on average 1.089430894308943) internal successors, (134), 118 states have internal predecessors, (134), 70 states have call successors, (70), 33 states have call predecessors, (70), 51 states have return successors, (209), 93 states have call predecessors, (209), 69 states have call successors, (209) [2023-04-03 01:12:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 413 transitions. [2023-04-03 01:12:08,299 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 413 transitions. Word has length 101 [2023-04-03 01:12:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:08,299 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 413 transitions. [2023-04-03 01:12:08,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 38 states have internal predecessors, (69), 16 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (34), 25 states have call predecessors, (34), 16 states have call successors, (34) [2023-04-03 01:12:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 413 transitions. [2023-04-03 01:12:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-04-03 01:12:08,306 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:08,306 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:08,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-03 01:12:08,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:08,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:08,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 422544529, now seen corresponding path program 6 times [2023-04-03 01:12:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731666400] [2023-04-03 01:12:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 148 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-04-03 01:12:08,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731666400] [2023-04-03 01:12:08,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731666400] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831704420] [2023-04-03 01:12:08,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:12:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:08,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:12:08,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-03 01:12:08,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:12:08,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:08,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-03 01:12:08,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 138 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-04-03 01:12:08,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 48 proven. 156 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-04-03 01:12:09,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831704420] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:09,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238261658] [2023-04-03 01:12:09,614 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:09,614 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:09,615 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:09,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:09,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 23 [2023-04-03 01:12:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566671315] [2023-04-03 01:12:09,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:09,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-03 01:12:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-03 01:12:09,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:12:09,620 INFO L87 Difference]: Start difference. First operand 245 states and 413 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) [2023-04-03 01:12:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:09,816 INFO L93 Difference]: Finished difference Result 370 states and 698 transitions. [2023-04-03 01:12:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-03 01:12:09,817 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) Word has length 107 [2023-04-03 01:12:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:09,821 INFO L225 Difference]: With dead ends: 370 [2023-04-03 01:12:09,821 INFO L226 Difference]: Without dead ends: 349 [2023-04-03 01:12:09,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 202 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2023-04-03 01:12:09,825 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:09,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:12:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-04-03 01:12:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 329. [2023-04-03 01:12:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 154 states have (on average 1.0974025974025974) internal successors, (169), 149 states have internal predecessors, (169), 106 states have call successors, (106), 41 states have call predecessors, (106), 68 states have return successors, (358), 138 states have call predecessors, (358), 105 states have call successors, (358) [2023-04-03 01:12:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 633 transitions. [2023-04-03 01:12:09,882 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 633 transitions. Word has length 107 [2023-04-03 01:12:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:09,883 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 633 transitions. [2023-04-03 01:12:09,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (22), 9 states have call predecessors, (22), 15 states have call successors, (22) [2023-04-03 01:12:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 633 transitions. [2023-04-03 01:12:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-04-03 01:12:09,889 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:09,889 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 10, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:09,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-03 01:12:10,094 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,SelfDestructingSolverStorable8 [2023-04-03 01:12:10,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:10,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash 432147001, now seen corresponding path program 7 times [2023-04-03 01:12:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:10,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632287825] [2023-04-03 01:12:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 103 proven. 231 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-04-03 01:12:10,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632287825] [2023-04-03 01:12:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632287825] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193592145] [2023-04-03 01:12:10,218 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:12:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:10,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:12:10,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-03 01:12:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:10,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-03 01:12:10,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 430 proven. 88 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-04-03 01:12:10,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 103 proven. 236 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2023-04-03 01:12:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193592145] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203656817] [2023-04-03 01:12:10,902 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:10,902 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:10,903 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:10,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2023-04-03 01:12:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335134388] [2023-04-03 01:12:10,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:10,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-03 01:12:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-03 01:12:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:12:10,904 INFO L87 Difference]: Start difference. First operand 329 states and 633 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-03 01:12:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:11,056 INFO L93 Difference]: Finished difference Result 512 states and 1057 transitions. [2023-04-03 01:12:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-03 01:12:11,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) Word has length 121 [2023-04-03 01:12:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:11,059 INFO L225 Difference]: With dead ends: 512 [2023-04-03 01:12:11,059 INFO L226 Difference]: Without dead ends: 285 [2023-04-03 01:12:11,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 235 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-03 01:12:11,060 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:11,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 169 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:12:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-04-03 01:12:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2023-04-03 01:12:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 125 states have internal predecessors, (138), 81 states have call successors, (81), 34 states have call predecessors, (81), 55 states have return successors, (254), 104 states have call predecessors, (254), 80 states have call successors, (254) [2023-04-03 01:12:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 473 transitions. [2023-04-03 01:12:11,113 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 473 transitions. Word has length 121 [2023-04-03 01:12:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:11,114 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 473 transitions. [2023-04-03 01:12:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (21), 2 states have call predecessors, (21), 7 states have return successors, (23), 6 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-03 01:12:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 473 transitions. [2023-04-03 01:12:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-04-03 01:12:11,116 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:11,116 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 10, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:11,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-03 01:12:11,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-03 01:12:11,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:11,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1106151801, now seen corresponding path program 8 times [2023-04-03 01:12:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:11,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252493571] [2023-04-03 01:12:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 121 proven. 213 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2023-04-03 01:12:11,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252493571] [2023-04-03 01:12:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252493571] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558477886] [2023-04-03 01:12:11,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:12:11,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:11,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:11,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:12:11,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-03 01:12:11,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-03 01:12:11,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:11,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-03 01:12:11,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 63 proven. 185 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2023-04-03 01:12:11,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 63 proven. 198 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2023-04-03 01:12:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558477886] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462847059] [2023-04-03 01:12:12,230 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:12,230 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:12,231 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:12,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:12,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 17] total 27 [2023-04-03 01:12:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888454830] [2023-04-03 01:12:12,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:12,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-03 01:12:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-03 01:12:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-04-03 01:12:12,232 INFO L87 Difference]: Start difference. First operand 264 states and 473 transitions. Second operand has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-03 01:12:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:12,641 INFO L93 Difference]: Finished difference Result 474 states and 904 transitions. [2023-04-03 01:12:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-03 01:12:12,642 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) Word has length 121 [2023-04-03 01:12:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:12,643 INFO L225 Difference]: With dead ends: 474 [2023-04-03 01:12:12,643 INFO L226 Difference]: Without dead ends: 255 [2023-04-03 01:12:12,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1637, Unknown=0, NotChecked=0, Total=1980 [2023-04-03 01:12:12,646 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:12,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 284 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:12:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-04-03 01:12:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 224. [2023-04-03 01:12:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 113 states have (on average 1.0530973451327434) internal successors, (119), 112 states have internal predecessors, (119), 69 states have call successors, (69), 34 states have call predecessors, (69), 41 states have return successors, (152), 77 states have call predecessors, (152), 68 states have call successors, (152) [2023-04-03 01:12:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 340 transitions. [2023-04-03 01:12:12,668 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 340 transitions. Word has length 121 [2023-04-03 01:12:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:12,668 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 340 transitions. [2023-04-03 01:12:12,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 20 states have call successors, (27), 1 states have call predecessors, (27), 14 states have return successors, (33), 13 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-03 01:12:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 340 transitions. [2023-04-03 01:12:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-04-03 01:12:12,671 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:12,671 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 16, 15, 15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:12,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-03 01:12:12,889 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,SelfDestructingSolverStorable10 [2023-04-03 01:12:12,889 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:12,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash 925222033, now seen corresponding path program 9 times [2023-04-03 01:12:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727918483] [2023-04-03 01:12:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 74 proven. 705 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2023-04-03 01:12:14,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727918483] [2023-04-03 01:12:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727918483] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448990629] [2023-04-03 01:12:14,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:12:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:14,125 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-03 01:12:14,126 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-03 01:12:14,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:12:14,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:14,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 175 conjunts are in the unsatisfiable core [2023-04-03 01:12:14,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 0 proven. 705 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2023-04-03 01:12:14,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-04-03 01:12:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448990629] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613627385] [2023-04-03 01:12:17,983 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:17,983 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:17,984 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:17,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 58] total 83 [2023-04-03 01:12:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587466394] [2023-04-03 01:12:17,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:17,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-04-03 01:12:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-04-03 01:12:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=6505, Unknown=0, NotChecked=0, Total=6806 [2023-04-03 01:12:17,987 INFO L87 Difference]: Start difference. First operand 224 states and 340 transitions. Second operand has 83 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 62 states have internal predecessors, (108), 29 states have call successors, (46), 20 states have call predecessors, (46), 41 states have return successors, (55), 42 states have call predecessors, (55), 29 states have call successors, (55) [2023-04-03 01:12:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:36,806 INFO L93 Difference]: Finished difference Result 1091 states and 1924 transitions. [2023-04-03 01:12:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2023-04-03 01:12:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 62 states have internal predecessors, (108), 29 states have call successors, (46), 20 states have call predecessors, (46), 41 states have return successors, (55), 42 states have call predecessors, (55), 29 states have call successors, (55) Word has length 187 [2023-04-03 01:12:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:36,813 INFO L225 Difference]: With dead ends: 1091 [2023-04-03 01:12:36,813 INFO L226 Difference]: Without dead ends: 1087 [2023-04-03 01:12:36,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 360 SyntacticMatches, 23 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18099 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=8324, Invalid=52438, Unknown=0, NotChecked=0, Total=60762 [2023-04-03 01:12:36,823 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1590 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 3732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 7160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3732 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:36,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 940 Invalid, 7160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3732 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-04-03 01:12:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-04-03 01:12:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 828. [2023-04-03 01:12:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 410 states have (on average 1.0560975609756098) internal successors, (433), 400 states have internal predecessors, (433), 269 states have call successors, (269), 127 states have call predecessors, (269), 148 states have return successors, (707), 300 states have call predecessors, (707), 268 states have call successors, (707) [2023-04-03 01:12:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1409 transitions. [2023-04-03 01:12:36,927 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1409 transitions. Word has length 187 [2023-04-03 01:12:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:36,927 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1409 transitions. [2023-04-03 01:12:36,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 62 states have internal predecessors, (108), 29 states have call successors, (46), 20 states have call predecessors, (46), 41 states have return successors, (55), 42 states have call predecessors, (55), 29 states have call successors, (55) [2023-04-03 01:12:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1409 transitions. [2023-04-03 01:12:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-04-03 01:12:36,933 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:36,933 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 16, 15, 15, 15, 15, 15, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:36,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-04-03 01:12:37,139 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,SelfDestructingSolverStorable11 [2023-04-03 01:12:37,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:37,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1648036327, now seen corresponding path program 10 times [2023-04-03 01:12:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743376278] [2023-04-03 01:12:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 115 proven. 415 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2023-04-03 01:12:37,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743376278] [2023-04-03 01:12:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743376278] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671351872] [2023-04-03 01:12:37,399 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:12:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:37,400 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-03 01:12:37,402 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-03 01:12:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:37,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-03 01:12:37,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 115 proven. 415 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2023-04-03 01:12:37,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 115 proven. 447 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2023-04-03 01:12:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671351872] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1400595097] [2023-04-03 01:12:38,707 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:38,707 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:38,707 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:38,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 23] total 25 [2023-04-03 01:12:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548017480] [2023-04-03 01:12:38,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-03 01:12:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-03 01:12:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-04-03 01:12:38,709 INFO L87 Difference]: Start difference. First operand 828 states and 1409 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 16 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) [2023-04-03 01:12:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:38,984 INFO L93 Difference]: Finished difference Result 1058 states and 2142 transitions. [2023-04-03 01:12:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-03 01:12:38,984 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 16 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) Word has length 193 [2023-04-03 01:12:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:39,008 INFO L225 Difference]: With dead ends: 1058 [2023-04-03 01:12:39,008 INFO L226 Difference]: Without dead ends: 1034 [2023-04-03 01:12:39,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 374 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2023-04-03 01:12:39,009 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:39,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:12:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2023-04-03 01:12:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 819. [2023-04-03 01:12:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 403 states have (on average 1.054590570719603) internal successors, (425), 392 states have internal predecessors, (425), 269 states have call successors, (269), 126 states have call predecessors, (269), 146 states have return successors, (731), 300 states have call predecessors, (731), 268 states have call successors, (731) [2023-04-03 01:12:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1425 transitions. [2023-04-03 01:12:39,106 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1425 transitions. Word has length 193 [2023-04-03 01:12:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:39,106 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1425 transitions. [2023-04-03 01:12:39,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 16 states have call successors, (20), 1 states have call predecessors, (20), 11 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) [2023-04-03 01:12:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1425 transitions. [2023-04-03 01:12:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-04-03 01:12:39,112 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:39,112 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 24, 23, 23, 23, 23, 23, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:39,119 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-03 01:12:39,318 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,SelfDestructingSolverStorable12 [2023-04-03 01:12:39,319 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:39,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 698997393, now seen corresponding path program 11 times [2023-04-03 01:12:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084407513] [2023-04-03 01:12:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 645 proven. 819 refuted. 0 times theorem prover too weak. 3396 trivial. 0 not checked. [2023-04-03 01:12:39,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084407513] [2023-04-03 01:12:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084407513] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967671659] [2023-04-03 01:12:39,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:12:39,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:39,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:39,653 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-03 01:12:39,654 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-03 01:12:39,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-04-03 01:12:39,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:39,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 39 conjunts are in the unsatisfiable core [2023-04-03 01:12:39,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 192 proven. 667 refuted. 0 times theorem prover too weak. 4001 trivial. 0 not checked. [2023-04-03 01:12:39,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 192 proven. 692 refuted. 0 times theorem prover too weak. 3976 trivial. 0 not checked. [2023-04-03 01:12:40,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967671659] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235062008] [2023-04-03 01:12:40,797 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:40,797 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:40,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-03 01:12:40,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 21] total 35 [2023-04-03 01:12:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834147479] [2023-04-03 01:12:40,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:40,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-03 01:12:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-03 01:12:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2023-04-03 01:12:40,799 INFO L87 Difference]: Start difference. First operand 819 states and 1425 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 27 states have call successors, (33), 1 states have call predecessors, (33), 20 states have return successors, (44), 19 states have call predecessors, (44), 27 states have call successors, (44) [2023-04-03 01:12:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:12:41,310 INFO L93 Difference]: Finished difference Result 1050 states and 1954 transitions. [2023-04-03 01:12:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-03 01:12:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 27 states have call successors, (33), 1 states have call predecessors, (33), 20 states have return successors, (44), 19 states have call predecessors, (44), 27 states have call successors, (44) Word has length 267 [2023-04-03 01:12:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:12:41,315 INFO L225 Difference]: With dead ends: 1050 [2023-04-03 01:12:41,315 INFO L226 Difference]: Without dead ends: 509 [2023-04-03 01:12:41,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=439, Invalid=2317, Unknown=0, NotChecked=0, Total=2756 [2023-04-03 01:12:41,319 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 95 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:12:41,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 450 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:12:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-04-03 01:12:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 417. [2023-04-03 01:12:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 218 states have (on average 1.055045871559633) internal successors, (230), 214 states have internal predecessors, (230), 125 states have call successors, (125), 70 states have call predecessors, (125), 73 states have return successors, (265), 132 states have call predecessors, (265), 124 states have call successors, (265) [2023-04-03 01:12:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2023-04-03 01:12:41,365 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 267 [2023-04-03 01:12:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:12:41,365 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2023-04-03 01:12:41,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 27 states have call successors, (33), 1 states have call predecessors, (33), 20 states have return successors, (44), 19 states have call predecessors, (44), 27 states have call successors, (44) [2023-04-03 01:12:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2023-04-03 01:12:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2023-04-03 01:12:41,370 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:12:41,370 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 32, 31, 31, 31, 31, 31, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:12:41,383 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-03 01:12:41,576 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,SelfDestructingSolverStorable13 [2023-04-03 01:12:41,576 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:12:41,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:12:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1899858407, now seen corresponding path program 12 times [2023-04-03 01:12:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:12:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067194683] [2023-04-03 01:12:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:12:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:12:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:12:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8794 backedges. 154 proven. 2940 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2023-04-03 01:12:44,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:12:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067194683] [2023-04-03 01:12:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067194683] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:12:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134937617] [2023-04-03 01:12:44,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:12:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:12:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:12:44,812 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-03 01:12:44,813 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-03 01:12:45,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:12:45,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:12:45,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 339 conjunts are in the unsatisfiable core [2023-04-03 01:12:45,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:12:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8794 backedges. 0 proven. 2940 refuted. 0 times theorem prover too weak. 5854 trivial. 0 not checked. [2023-04-03 01:12:46,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:12:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8794 backedges. 0 proven. 8644 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-04-03 01:12:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134937617] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:12:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462164375] [2023-04-03 01:12:53,166 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:12:53,166 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:12:53,166 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:12:53,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:12:53,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 108] total 139 [2023-04-03 01:12:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719044748] [2023-04-03 01:12:53,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:12:53,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2023-04-03 01:12:53,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:12:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2023-04-03 01:12:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=18689, Unknown=0, NotChecked=0, Total=19182 [2023-04-03 01:12:53,175 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand has 139 states, 104 states have (on average 1.7211538461538463) internal successors, (179), 106 states have internal predecessors, (179), 54 states have call successors, (79), 36 states have call predecessors, (79), 69 states have return successors, (92), 71 states have call predecessors, (92), 54 states have call successors, (92) [2023-04-03 01:14:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:14:43,002 INFO L93 Difference]: Finished difference Result 1278 states and 2206 transitions. [2023-04-03 01:14:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 402 states. [2023-04-03 01:14:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 104 states have (on average 1.7211538461538463) internal successors, (179), 106 states have internal predecessors, (179), 54 states have call successors, (79), 36 states have call predecessors, (79), 69 states have return successors, (92), 71 states have call predecessors, (92), 54 states have call successors, (92) Word has length 353 [2023-04-03 01:14:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:14:43,009 INFO L225 Difference]: With dead ends: 1278 [2023-04-03 01:14:43,009 INFO L226 Difference]: Without dead ends: 1274 [2023-04-03 01:14:43,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 701 SyntacticMatches, 40 SemanticMatches, 525 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88554 ImplicationChecksByTransitivity, 105.0s TimeCoverageRelationStatistics Valid=38219, Invalid=238983, Unknown=0, NotChecked=0, Total=277202 [2023-04-03 01:14:43,026 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6116 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 9291 mSolverCounterSat, 14266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6122 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 23557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14266 IncrementalHoareTripleChecker+Valid, 9291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-04-03 01:14:43,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6122 Valid, 2215 Invalid, 23557 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14266 Valid, 9291 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-04-03 01:14:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2023-04-03 01:14:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1101. [2023-04-03 01:14:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 590 states have (on average 1.0491525423728814) internal successors, (619), 571 states have internal predecessors, (619), 326 states have call successors, (326), 198 states have call predecessors, (326), 184 states have return successors, (770), 331 states have call predecessors, (770), 325 states have call successors, (770) [2023-04-03 01:14:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1715 transitions. [2023-04-03 01:14:43,180 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1715 transitions. Word has length 353 [2023-04-03 01:14:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:14:43,181 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1715 transitions. [2023-04-03 01:14:43,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 104 states have (on average 1.7211538461538463) internal successors, (179), 106 states have internal predecessors, (179), 54 states have call successors, (79), 36 states have call predecessors, (79), 69 states have return successors, (92), 71 states have call predecessors, (92), 54 states have call successors, (92) [2023-04-03 01:14:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1715 transitions. [2023-04-03 01:14:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2023-04-03 01:14:43,188 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:14:43,188 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 32, 31, 31, 31, 31, 31, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:14:43,203 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-03 01:14:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:43,401 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:14:43,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:14:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1502364079, now seen corresponding path program 13 times [2023-04-03 01:14:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:14:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764531025] [2023-04-03 01:14:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:14:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:14:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 254 proven. 1112 refuted. 0 times theorem prover too weak. 7456 trivial. 0 not checked. [2023-04-03 01:14:43,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:14:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764531025] [2023-04-03 01:14:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764531025] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:14:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338769262] [2023-04-03 01:14:43,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:14:43,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:43,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:14:43,894 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-03 01:14:43,895 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-03 01:14:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:44,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-03 01:14:44,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:14:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 254 proven. 1112 refuted. 0 times theorem prover too weak. 7456 trivial. 0 not checked. [2023-04-03 01:14:44,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:14:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8822 backedges. 254 proven. 1162 refuted. 0 times theorem prover too weak. 7406 trivial. 0 not checked. [2023-04-03 01:14:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338769262] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:14:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [821281155] [2023-04-03 01:14:46,366 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:14:46,366 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:14:46,366 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:14:46,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:14:46,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 27] total 29 [2023-04-03 01:14:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047538497] [2023-04-03 01:14:46,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:14:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-03 01:14:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:14:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-03 01:14:46,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2023-04-03 01:14:46,367 INFO L87 Difference]: Start difference. First operand 1101 states and 1715 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 19 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (30), 13 states have call predecessors, (30), 19 states have call successors, (30) [2023-04-03 01:14:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:14:46,740 INFO L93 Difference]: Finished difference Result 1268 states and 2335 transitions. [2023-04-03 01:14:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-03 01:14:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 19 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (30), 13 states have call predecessors, (30), 19 states have call successors, (30) Word has length 359 [2023-04-03 01:14:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:14:46,748 INFO L225 Difference]: With dead ends: 1268 [2023-04-03 01:14:46,748 INFO L226 Difference]: Without dead ends: 1241 [2023-04-03 01:14:46,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 704 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1321, Unknown=0, NotChecked=0, Total=1640 [2023-04-03 01:14:46,749 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:14:46,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 313 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:14:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2023-04-03 01:14:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1089. [2023-04-03 01:14:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 581 states have (on average 1.0481927710843373) internal successors, (609), 561 states have internal predecessors, (609), 326 states have call successors, (326), 197 states have call predecessors, (326), 181 states have return successors, (820), 330 states have call predecessors, (820), 325 states have call successors, (820) [2023-04-03 01:14:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1755 transitions. [2023-04-03 01:14:46,913 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1755 transitions. Word has length 359 [2023-04-03 01:14:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:14:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 1755 transitions. [2023-04-03 01:14:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 19 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (30), 13 states have call predecessors, (30), 19 states have call successors, (30) [2023-04-03 01:14:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1755 transitions. [2023-04-03 01:14:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-04-03 01:14:46,922 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:14:46,922 INFO L195 NwaCegarLoop]: trace histogram [79, 79, 40, 39, 39, 39, 39, 39, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:14:46,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-04-03 01:14:47,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-03 01:14:47,130 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:14:47,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:14:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1320520217, now seen corresponding path program 14 times [2023-04-03 01:14:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:14:47,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714969154] [2023-04-03 01:14:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:14:47,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:14:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13858 backedges. 1349 proven. 1794 refuted. 0 times theorem prover too weak. 10715 trivial. 0 not checked. [2023-04-03 01:14:47,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:14:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714969154] [2023-04-03 01:14:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714969154] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:14:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969939511] [2023-04-03 01:14:47,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:14:47,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:14:47,734 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:14:47,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-04-03 01:14:48,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2023-04-03 01:14:48,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:14:48,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-03 01:14:48,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:14:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13858 backedges. 2180 proven. 577 refuted. 0 times theorem prover too weak. 11101 trivial. 0 not checked. [2023-04-03 01:14:48,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:14:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13858 backedges. 2180 proven. 611 refuted. 0 times theorem prover too weak. 11067 trivial. 0 not checked. [2023-04-03 01:14:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969939511] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:14:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [736272542] [2023-04-03 01:14:50,344 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:14:50,344 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:14:50,345 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:14:50,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:14:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 26 [2023-04-03 01:14:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054606076] [2023-04-03 01:14:50,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:14:50,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-03 01:14:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:14:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-03 01:14:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:14:50,347 INFO L87 Difference]: Start difference. First operand 1089 states and 1755 transitions. Second operand has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 21 states have call successors, (37), 2 states have call predecessors, (37), 13 states have return successors, (53), 22 states have call predecessors, (53), 21 states have call successors, (53) [2023-04-03 01:14:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:14:50,764 INFO L93 Difference]: Finished difference Result 2009 states and 3477 transitions. [2023-04-03 01:14:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-04-03 01:14:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 21 states have call successors, (37), 2 states have call predecessors, (37), 13 states have return successors, (53), 22 states have call predecessors, (53), 21 states have call successors, (53) Word has length 433 [2023-04-03 01:14:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:14:50,772 INFO L225 Difference]: With dead ends: 2009 [2023-04-03 01:14:50,772 INFO L226 Difference]: Without dead ends: 1204 [2023-04-03 01:14:50,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 856 SyntacticMatches, 10 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=469, Invalid=1423, Unknown=0, NotChecked=0, Total=1892 [2023-04-03 01:14:50,778 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 88 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:14:50,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 313 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:14:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2023-04-03 01:14:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 980. [2023-04-03 01:14:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 493 states have (on average 1.054766734279919) internal successors, (520), 493 states have internal predecessors, (520), 305 states have call successors, (305), 153 states have call predecessors, (305), 181 states have return successors, (533), 333 states have call predecessors, (533), 304 states have call successors, (533) [2023-04-03 01:14:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1358 transitions. [2023-04-03 01:14:50,967 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1358 transitions. Word has length 433 [2023-04-03 01:14:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:14:50,967 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1358 transitions. [2023-04-03 01:14:50,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 21 states have call successors, (37), 2 states have call predecessors, (37), 13 states have return successors, (53), 22 states have call predecessors, (53), 21 states have call successors, (53) [2023-04-03 01:14:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1358 transitions. [2023-04-03 01:14:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2023-04-03 01:14:50,974 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:14:50,974 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 48, 47, 47, 47, 47, 47, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:14:50,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-04-03 01:14:51,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-03 01:14:51,181 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:14:51,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:14:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash 698130969, now seen corresponding path program 15 times [2023-04-03 01:14:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:14:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851961065] [2023-04-03 01:14:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:14:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:14:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20074 backedges. 1640 proven. 2215 refuted. 0 times theorem prover too weak. 16219 trivial. 0 not checked. [2023-04-03 01:14:51,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:14:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851961065] [2023-04-03 01:14:51,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851961065] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:14:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992377351] [2023-04-03 01:14:51,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:14:51,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:51,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:14:51,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:14:51,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-04-03 01:14:52,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:14:52,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:14:52,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-03 01:14:52,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:14:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20074 backedges. 1640 proven. 2215 refuted. 0 times theorem prover too weak. 16219 trivial. 0 not checked. [2023-04-03 01:14:52,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:14:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20074 backedges. 1640 proven. 2256 refuted. 0 times theorem prover too weak. 16178 trivial. 0 not checked. [2023-04-03 01:14:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992377351] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:14:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075421340] [2023-04-03 01:14:54,874 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:14:54,874 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:14:54,874 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:14:54,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:14:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 25] total 27 [2023-04-03 01:14:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185756188] [2023-04-03 01:14:54,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:14:54,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-03 01:14:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:14:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-03 01:14:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2023-04-03 01:14:54,876 INFO L87 Difference]: Start difference. First operand 980 states and 1358 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 23 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 12 states have call predecessors, (37), 23 states have call successors, (37) [2023-04-03 01:14:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:14:55,296 INFO L93 Difference]: Finished difference Result 1346 states and 1938 transitions. [2023-04-03 01:14:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-04-03 01:14:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 23 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 12 states have call predecessors, (37), 23 states have call successors, (37) Word has length 513 [2023-04-03 01:14:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:14:55,302 INFO L225 Difference]: With dead ends: 1346 [2023-04-03 01:14:55,303 INFO L226 Difference]: Without dead ends: 1180 [2023-04-03 01:14:55,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 1013 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=489, Invalid=1403, Unknown=0, NotChecked=0, Total=1892 [2023-04-03 01:14:55,305 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:14:55,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 369 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:14:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2023-04-03 01:14:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 977. [2023-04-03 01:14:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 492 states have (on average 1.0548780487804879) internal successors, (519), 492 states have internal predecessors, (519), 305 states have call successors, (305), 154 states have call predecessors, (305), 179 states have return successors, (501), 330 states have call predecessors, (501), 304 states have call successors, (501) [2023-04-03 01:14:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1325 transitions. [2023-04-03 01:14:55,450 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1325 transitions. Word has length 513 [2023-04-03 01:14:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:14:55,450 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1325 transitions. [2023-04-03 01:14:55,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 23 states have call successors, (30), 2 states have call predecessors, (30), 13 states have return successors, (37), 12 states have call predecessors, (37), 23 states have call successors, (37) [2023-04-03 01:14:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1325 transitions. [2023-04-03 01:14:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2023-04-03 01:14:55,456 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:14:55,456 INFO L195 NwaCegarLoop]: trace histogram [127, 127, 64, 63, 63, 63, 63, 63, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:14:55,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-04-03 01:14:55,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-04-03 01:14:55,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:14:55,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:14:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 796227097, now seen corresponding path program 16 times [2023-04-03 01:14:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:14:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042297806] [2023-04-03 01:14:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:14:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:14:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 35962 backedges. 537 proven. 2750 refuted. 0 times theorem prover too weak. 32675 trivial. 0 not checked. [2023-04-03 01:14:56,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:14:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042297806] [2023-04-03 01:14:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042297806] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:14:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431804777] [2023-04-03 01:14:56,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:14:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:14:56,682 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:14:56,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-04-03 01:14:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:14:57,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 3240 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-03 01:14:57,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:14:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 35962 backedges. 537 proven. 2750 refuted. 0 times theorem prover too weak. 32675 trivial. 0 not checked. [2023-04-03 01:14:57,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:14:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 35962 backedges. 537 proven. 2802 refuted. 0 times theorem prover too weak. 32623 trivial. 0 not checked. [2023-04-03 01:14:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431804777] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:14:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1041964228] [2023-04-03 01:14:59,158 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:14:59,159 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:14:59,159 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:14:59,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:14:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 27] total 29 [2023-04-03 01:14:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195092266] [2023-04-03 01:14:59,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:14:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-03 01:14:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:14:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-03 01:14:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2023-04-03 01:14:59,161 INFO L87 Difference]: Start difference. First operand 977 states and 1325 transitions. Second operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 20 states have call successors, (24), 1 states have call predecessors, (24), 13 states have return successors, (31), 13 states have call predecessors, (31), 20 states have call successors, (31) [2023-04-03 01:14:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:14:59,533 INFO L93 Difference]: Finished difference Result 1042 states and 1390 transitions. [2023-04-03 01:14:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-03 01:14:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 20 states have call successors, (24), 1 states have call predecessors, (24), 13 states have return successors, (31), 13 states have call predecessors, (31), 20 states have call successors, (31) Word has length 673 [2023-04-03 01:14:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:14:59,537 INFO L225 Difference]: With dead ends: 1042 [2023-04-03 01:14:59,538 INFO L226 Difference]: Without dead ends: 1038 [2023-04-03 01:14:59,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1384 GetRequests, 1332 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2023-04-03 01:14:59,539 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:14:59,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 227 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:14:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2023-04-03 01:14:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 980. [2023-04-03 01:14:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 494 states have (on average 1.0546558704453441) internal successors, (521), 494 states have internal predecessors, (521), 305 states have call successors, (305), 154 states have call predecessors, (305), 180 states have return successors, (502), 331 states have call predecessors, (502), 304 states have call successors, (502) [2023-04-03 01:14:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1328 transitions. [2023-04-03 01:14:59,679 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1328 transitions. Word has length 673 [2023-04-03 01:14:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:14:59,679 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1328 transitions. [2023-04-03 01:14:59,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 20 states have call successors, (24), 1 states have call predecessors, (24), 13 states have return successors, (31), 13 states have call predecessors, (31), 20 states have call successors, (31) [2023-04-03 01:14:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1328 transitions. [2023-04-03 01:14:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2023-04-03 01:14:59,685 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:14:59,686 INFO L195 NwaCegarLoop]: trace histogram [127, 127, 64, 63, 63, 63, 63, 63, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:14:59,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-04-03 01:14:59,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:14:59,895 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:14:59,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:14:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1259946415, now seen corresponding path program 17 times [2023-04-03 01:14:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:14:59,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236142548] [2023-04-03 01:14:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:14:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:14:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:15:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35990 backedges. 314 proven. 12010 refuted. 0 times theorem prover too weak. 23666 trivial. 0 not checked. [2023-04-03 01:15:11,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:15:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236142548] [2023-04-03 01:15:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236142548] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:15:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702731063] [2023-04-03 01:15:11,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:15:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:15:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:15:11,875 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:15:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-04-03 01:15:13,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 101 check-sat command(s) [2023-04-03 01:15:13,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:15:13,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 3252 conjuncts, 663 conjunts are in the unsatisfiable core [2023-04-03 01:15:13,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:15:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35990 backedges. 0 proven. 12010 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2023-04-03 01:15:14,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:15:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 35990 backedges. 0 proven. 35698 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-04-03 01:15:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702731063] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:15:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633635332] [2023-04-03 01:15:31,336 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-04-03 01:15:31,337 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:15:31,337 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:15:31,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:15:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 206] total 243 [2023-04-03 01:15:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002926553] [2023-04-03 01:15:31,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:15:31,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 243 states [2023-04-03 01:15:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:15:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2023-04-03 01:15:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=57973, Unknown=0, NotChecked=0, Total=58806 [2023-04-03 01:15:31,343 INFO L87 Difference]: Start difference. First operand 980 states and 1328 transitions. Second operand has 243 states, 175 states have (on average 1.7942857142857143) internal successors, (314), 190 states have internal predecessors, (314), 103 states have call successors, (144), 68 states have call predecessors, (144), 121 states have return successors, (161), 124 states have call predecessors, (161), 103 states have call successors, (161)