/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/recursive-simple/fibo_10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 12:11:57,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 12:11:57,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 12:11:57,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 12:11:57,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 12:11:57,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 12:11:57,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 12:11:57,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 12:11:57,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 12:11:57,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 12:11:57,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 12:11:57,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 12:11:57,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 12:11:57,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 12:11:57,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 12:11:57,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 12:11:57,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 12:11:57,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 12:11:57,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 12:11:57,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 12:11:57,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 12:11:57,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 12:11:57,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 12:11:57,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 12:11:57,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 12:11:57,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 12:11:57,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 12:11:57,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 12:11:57,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 12:11:57,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 12:11:57,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 12:11:57,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 12:11:57,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 12:11:57,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 12:11:57,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 12:11:57,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 12:11:57,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 12:11:57,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 12:11:57,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 12:11:57,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 12:11:57,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 12:11:57,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 12:11:57,131 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 12:11:57,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 12:11:57,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 12:11:57,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 12:11:57,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 12:11:57,133 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 12:11:57,133 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 12:11:57,134 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 12:11:57,134 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 12:11:57,134 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 12:11:57,134 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 12:11:57,134 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 12:11:57,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 12:11:57,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 12:11:57,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 12:11:57,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:11:57,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 12:11:57,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 12:11:57,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 12:11:57,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 12:11:57,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 12:11:57,379 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 12:11:57,379 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 12:11:57,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-2.c [2023-04-01 12:11:58,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 12:11:59,215 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 12:11:59,216 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c [2023-04-01 12:11:59,234 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb04d09e/9c54406839b442c2861f975e2755663f/FLAG2b4b1ebbe [2023-04-01 12:11:59,250 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb04d09e/9c54406839b442c2861f975e2755663f [2023-04-01 12:11:59,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 12:11:59,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 12:11:59,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 12:11:59,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 12:11:59,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 12:11:59,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd68a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59, skipping insertion in model container [2023-04-01 12:11:59,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 12:11:59,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 12:11:59,583 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2023-04-01 12:11:59,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:11:59,615 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 12:11:59,629 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-2.c[743,756] [2023-04-01 12:11:59,645 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 12:11:59,656 INFO L208 MainTranslator]: Completed translation [2023-04-01 12:11:59,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59 WrapperNode [2023-04-01 12:11:59,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 12:11:59,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 12:11:59,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 12:11:59,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 12:11:59,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 12:11:59,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 12:11:59,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 12:11:59,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 12:11:59,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (1/1) ... [2023-04-01 12:11:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 12:11:59,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:11:59,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 12:11:59,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 12:11:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 12:11:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 12:11:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 12:11:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2023-04-01 12:11:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 12:11:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 12:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 12:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 12:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 12:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 12:11:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 12:11:59,990 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 12:11:59,992 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 12:12:00,213 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 12:12:00,250 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 12:12:00,250 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 12:12:00,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:12:00 BoogieIcfgContainer [2023-04-01 12:12:00,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 12:12:00,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 12:12:00,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 12:12:00,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 12:12:00,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:11:59" (1/3) ... [2023-04-01 12:12:00,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd80dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:12:00, skipping insertion in model container [2023-04-01 12:12:00,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:11:59" (2/3) ... [2023-04-01 12:12:00,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd80dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:12:00, skipping insertion in model container [2023-04-01 12:12:00,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:12:00" (3/3) ... [2023-04-01 12:12:00,280 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-2.c [2023-04-01 12:12:00,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 12:12:00,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 12:12:00,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 12:12:00,464 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;@77d9407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 12:12:00,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 12:12:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 12:12:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 12:12:00,488 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:00,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:00,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:00,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -207187148, now seen corresponding path program 1 times [2023-04-01 12:12:00,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606865199] [2023-04-01 12:12:00,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:12:00,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606865199] [2023-04-01 12:12:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606865199] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:12:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:12:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:12:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192993309] [2023-04-01 12:12:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:12:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:12:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:12:01,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:12:01,042 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 12:12:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:01,207 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-04-01 12:12:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 12:12:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-01 12:12:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:01,217 INFO L225 Difference]: With dead ends: 33 [2023-04-01 12:12:01,217 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 12:12:01,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 12:12:01,242 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:01,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 12:12:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 12:12:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 12:12:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 12:12:01,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-04-01 12:12:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:01,291 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 12:12:01,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 12:12:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 12:12:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 12:12:01,294 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:01,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:01,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 12:12:01,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:01,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1413002183, now seen corresponding path program 1 times [2023-04-01 12:12:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186101174] [2023-04-01 12:12:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 12:12:01,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186101174] [2023-04-01 12:12:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186101174] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 12:12:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 12:12:01,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 12:12:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028406168] [2023-04-01 12:12:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 12:12:01,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 12:12:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 12:12:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 12:12:01,506 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 12:12:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:01,607 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2023-04-01 12:12:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 12:12:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-04-01 12:12:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:01,610 INFO L225 Difference]: With dead ends: 27 [2023-04-01 12:12:01,610 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 12:12:01,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 12:12:01,612 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:01,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 12:12:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-04-01 12:12:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 12:12:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 12:12:01,618 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-04-01 12:12:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:01,619 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 12:12:01,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 12:12:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 12:12:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 12:12:01,620 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:01,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:01,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 12:12:01,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:01,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1852803964, now seen corresponding path program 1 times [2023-04-01 12:12:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15958891] [2023-04-01 12:12:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 12:12:01,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15958891] [2023-04-01 12:12:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15958891] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129479011] [2023-04-01 12:12:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:01,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:01,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 12:12:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:02,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:12:02,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 12:12:02,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:12:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129479011] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [504729540] [2023-04-01 12:12:02,652 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:02,652 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:02,656 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:02,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2023-04-01 12:12:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872659296] [2023-04-01 12:12:02,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:02,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 12:12:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 12:12:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:12:02,660 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 12:12:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:02,826 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-04-01 12:12:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 12:12:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2023-04-01 12:12:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:02,829 INFO L225 Difference]: With dead ends: 38 [2023-04-01 12:12:02,829 INFO L226 Difference]: Without dead ends: 23 [2023-04-01 12:12:02,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-04-01 12:12:02,833 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:02,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-01 12:12:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-01 12:12:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 12:12:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-01 12:12:02,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2023-04-01 12:12:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:02,865 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-01 12:12:02,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 12:12:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-01 12:12:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 12:12:02,867 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:02,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:02,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:03,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:03,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1799377537, now seen corresponding path program 1 times [2023-04-01 12:12:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526508803] [2023-04-01 12:12:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 12:12:03,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526508803] [2023-04-01 12:12:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526508803] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6668789] [2023-04-01 12:12:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:03,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 12:12:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:03,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:12:03,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 12:12:03,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 12:12:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6668789] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552232179] [2023-04-01 12:12:03,674 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:03,674 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:03,675 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:03,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 12:12:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98709049] [2023-04-01 12:12:03,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 12:12:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 12:12:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 12:12:03,684 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 12:12:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:03,779 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-04-01 12:12:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 12:12:03,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2023-04-01 12:12:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:03,785 INFO L225 Difference]: With dead ends: 32 [2023-04-01 12:12:03,785 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 12:12:03,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:12:03,786 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:03,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 55 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:12:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 12:12:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 12:12:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 12:12:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-04-01 12:12:03,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2023-04-01 12:12:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:03,797 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-04-01 12:12:03,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 12:12:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-04-01 12:12:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 12:12:03,799 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:03,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:03,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:04,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 12:12:04,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:04,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1917676903, now seen corresponding path program 2 times [2023-04-01 12:12:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000648000] [2023-04-01 12:12:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 12:12:04,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000648000] [2023-04-01 12:12:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000648000] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592739928] [2023-04-01 12:12:04,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:12:04,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:04,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:04,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 12:12:04,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 12:12:04,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:04,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 12:12:04,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 12:12:04,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 12:12:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592739928] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009524429] [2023-04-01 12:12:04,625 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:04,625 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:04,626 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:04,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:04,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2023-04-01 12:12:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256708043] [2023-04-01 12:12:04,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:04,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 12:12:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:04,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 12:12:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-04-01 12:12:04,630 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 12:12:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:04,894 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2023-04-01 12:12:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:12:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) Word has length 40 [2023-04-01 12:12:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:04,896 INFO L225 Difference]: With dead ends: 59 [2023-04-01 12:12:04,897 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 12:12:04,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-04-01 12:12:04,898 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 12:12:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-04-01 12:12:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-04-01 12:12:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-04-01 12:12:04,922 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2023-04-01 12:12:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:04,922 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-04-01 12:12:04,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 12:12:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-04-01 12:12:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 12:12:04,929 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:04,929 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:04,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:05,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:05,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:05,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash -660284548, now seen corresponding path program 3 times [2023-04-01 12:12:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385116877] [2023-04-01 12:12:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 12:12:05,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385116877] [2023-04-01 12:12:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385116877] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823827598] [2023-04-01 12:12:05,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:12:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:05,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:05,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 12:12:05,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:12:05,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:05,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:12:05,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 12:12:05,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-01 12:12:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823827598] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:05,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1981629542] [2023-04-01 12:12:05,900 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:05,900 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:05,900 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:05,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:05,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 12:12:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582619268] [2023-04-01 12:12:05,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 12:12:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:05,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 12:12:05,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 12:12:05,903 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 12:12:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:06,026 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2023-04-01 12:12:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 12:12:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 41 [2023-04-01 12:12:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:06,030 INFO L225 Difference]: With dead ends: 40 [2023-04-01 12:12:06,031 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 12:12:06,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-04-01 12:12:06,032 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:06,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 79 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 12:12:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 12:12:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-01 12:12:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-04-01 12:12:06,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 41 [2023-04-01 12:12:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:06,046 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-04-01 12:12:06,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 11 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-01 12:12:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-04-01 12:12:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-04-01 12:12:06,050 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:06,052 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:06,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 12:12:06,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:06,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:06,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash 754596439, now seen corresponding path program 4 times [2023-04-01 12:12:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799769292] [2023-04-01 12:12:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-04-01 12:12:06,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799769292] [2023-04-01 12:12:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799769292] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359212014] [2023-04-01 12:12:06,592 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:12:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:06,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:06,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 12:12:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:06,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 12:12:06,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-04-01 12:12:06,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2023-04-01 12:12:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359212014] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1296792877] [2023-04-01 12:12:07,451 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:07,451 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:07,451 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:07,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 12:12:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587262047] [2023-04-01 12:12:07,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:07,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 12:12:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 12:12:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 12:12:07,455 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 12:12:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:07,543 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2023-04-01 12:12:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 12:12:07,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 96 [2023-04-01 12:12:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:07,549 INFO L225 Difference]: With dead ends: 45 [2023-04-01 12:12:07,549 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 12:12:07,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-04-01 12:12:07,551 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:07,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 89 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 12:12:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 12:12:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-01 12:12:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (28), 10 states have call predecessors, (28), 7 states have call successors, (28) [2023-04-01 12:12:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2023-04-01 12:12:07,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 63 transitions. Word has length 96 [2023-04-01 12:12:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:07,581 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-04-01 12:12:07,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-04-01 12:12:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 63 transitions. [2023-04-01 12:12:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-04-01 12:12:07,587 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:07,587 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:07,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 12:12:07,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:07,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:07,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 249620502, now seen corresponding path program 5 times [2023-04-01 12:12:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894282737] [2023-04-01 12:12:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 86 proven. 516 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2023-04-01 12:12:08,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894282737] [2023-04-01 12:12:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894282737] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905790650] [2023-04-01 12:12:08,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:12:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:08,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:08,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 12:12:08,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 12:12:08,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:08,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 12:12:08,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 17 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2023-04-01 12:12:08,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 18 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2023-04-01 12:12:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905790650] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1521162143] [2023-04-01 12:12:09,362 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:09,363 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:09,365 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:09,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:09,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2023-04-01 12:12:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058236309] [2023-04-01 12:12:09,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:09,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 12:12:09,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:09,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 12:12:09,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-04-01 12:12:09,368 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2023-04-01 12:12:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:09,841 INFO L93 Difference]: Finished difference Result 98 states and 195 transitions. [2023-04-01 12:12:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 12:12:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 192 [2023-04-01 12:12:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:09,845 INFO L225 Difference]: With dead ends: 98 [2023-04-01 12:12:09,845 INFO L226 Difference]: Without dead ends: 62 [2023-04-01 12:12:09,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 378 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2023-04-01 12:12:09,849 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:09,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 118 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:12:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-04-01 12:12:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-04-01 12:12:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.146341463414634) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (23), 12 states have call predecessors, (23), 11 states have call successors, (23) [2023-04-01 12:12:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2023-04-01 12:12:09,871 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 192 [2023-04-01 12:12:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:09,872 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2023-04-01 12:12:09,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 10 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2023-04-01 12:12:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2023-04-01 12:12:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-04-01 12:12:09,887 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:09,887 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:09,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 12:12:10,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:10,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:10,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1950698244, now seen corresponding path program 6 times [2023-04-01 12:12:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286729982] [2023-04-01 12:12:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 12:12:10,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286729982] [2023-04-01 12:12:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286729982] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392119149] [2023-04-01 12:12:10,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:12:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:10,633 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:10,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 12:12:10,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:12:10,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:10,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 12:12:10,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2023-04-01 12:12:10,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2023-04-01 12:12:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392119149] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [980058598] [2023-04-01 12:12:12,570 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:12,570 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:12,570 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:12,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:12,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 12:12:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015724705] [2023-04-01 12:12:12,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:12,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 12:12:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 12:12:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 12:12:12,593 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 12:12:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:12,771 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2023-04-01 12:12:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 12:12:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) Word has length 177 [2023-04-01 12:12:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:12,773 INFO L225 Difference]: With dead ends: 71 [2023-04-01 12:12:12,773 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 12:12:12,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 12:12:12,775 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:12,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 88 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 12:12:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-04-01 12:12:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 43 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (31), 14 states have call predecessors, (31), 12 states have call successors, (31) [2023-04-01 12:12:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-04-01 12:12:12,796 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 177 [2023-04-01 12:12:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:12,797 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-04-01 12:12:12,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (20), 7 states have call predecessors, (20), 14 states have call successors, (20) [2023-04-01 12:12:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-04-01 12:12:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-04-01 12:12:12,801 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:12,801 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:12,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:13,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:13,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:13,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -661454596, now seen corresponding path program 7 times [2023-04-01 12:12:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415804254] [2023-04-01 12:12:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1259 refuted. 0 times theorem prover too weak. 4042 trivial. 0 not checked. [2023-04-01 12:12:14,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415804254] [2023-04-01 12:12:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415804254] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572998042] [2023-04-01 12:12:14,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:12:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:14,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:14,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:14,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 12:12:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:14,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 12:12:14,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1259 refuted. 0 times theorem prover too weak. 4042 trivial. 0 not checked. [2023-04-01 12:12:14,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 213 proven. 1316 refuted. 0 times theorem prover too weak. 3985 trivial. 0 not checked. [2023-04-01 12:12:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572998042] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956881178] [2023-04-01 12:12:16,971 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:16,971 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:16,971 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:16,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 12:12:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969366998] [2023-04-01 12:12:16,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:16,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 12:12:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 12:12:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 12:12:16,976 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 12:12:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:17,199 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2023-04-01 12:12:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 12:12:17,199 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 313 [2023-04-01 12:12:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:17,202 INFO L225 Difference]: With dead ends: 76 [2023-04-01 12:12:17,202 INFO L226 Difference]: Without dead ends: 72 [2023-04-01 12:12:17,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 618 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-04-01 12:12:17,203 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:17,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 112 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-04-01 12:12:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-04-01 12:12:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 14 states have call successors, (14), 9 states have call predecessors, (14), 10 states have return successors, (41), 16 states have call predecessors, (41), 13 states have call successors, (41) [2023-04-01 12:12:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2023-04-01 12:12:17,215 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 313 [2023-04-01 12:12:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:17,217 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2023-04-01 12:12:17,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2023-04-01 12:12:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2023-04-01 12:12:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2023-04-01 12:12:17,227 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:17,227 INFO L195 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:17,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:17,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 12:12:17,435 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:17,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1814099002, now seen corresponding path program 8 times [2023-04-01 12:12:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:17,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981371415] [2023-04-01 12:12:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 422 proven. 2921 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2023-04-01 12:12:18,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981371415] [2023-04-01 12:12:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981371415] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148851243] [2023-04-01 12:12:18,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 12:12:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:18,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:18,180 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:18,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 12:12:18,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2023-04-01 12:12:18,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:18,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 12:12:18,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 293 refuted. 0 times theorem prover too weak. 15890 trivial. 0 not checked. [2023-04-01 12:12:18,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2920 proven. 314 refuted. 0 times theorem prover too weak. 15869 trivial. 0 not checked. [2023-04-01 12:12:20,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148851243] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:20,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1240197303] [2023-04-01 12:12:20,435 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:20,435 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:20,436 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:20,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2023-04-01 12:12:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245901548] [2023-04-01 12:12:20,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-01 12:12:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-01 12:12:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-04-01 12:12:20,438 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 12:12:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:20,988 INFO L93 Difference]: Finished difference Result 185 states and 370 transitions. [2023-04-01 12:12:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-01 12:12:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) Word has length 572 [2023-04-01 12:12:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:20,989 INFO L225 Difference]: With dead ends: 185 [2023-04-01 12:12:20,989 INFO L226 Difference]: Without dead ends: 118 [2023-04-01 12:12:20,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1130 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=758, Invalid=2548, Unknown=0, NotChecked=0, Total=3306 [2023-04-01 12:12:20,991 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 174 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:20,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 165 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:12:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-04-01 12:12:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2023-04-01 12:12:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 70 states have internal predecessors, (79), 20 states have call successors, (20), 17 states have call predecessors, (20), 11 states have return successors, (46), 18 states have call predecessors, (46), 19 states have call successors, (46) [2023-04-01 12:12:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2023-04-01 12:12:20,998 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 572 [2023-04-01 12:12:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:20,998 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2023-04-01 12:12:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 states have internal predecessors, (83), 18 states have call successors, (28), 1 states have call predecessors, (28), 15 states have return successors, (39), 19 states have call predecessors, (39), 18 states have call successors, (39) [2023-04-01 12:12:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2023-04-01 12:12:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2023-04-01 12:12:21,007 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:21,007 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:21,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:21,214 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:21,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 608566348, now seen corresponding path program 9 times [2023-04-01 12:12:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:21,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781504326] [2023-04-01 12:12:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 12:12:22,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:22,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781504326] [2023-04-01 12:12:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781504326] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144262003] [2023-04-01 12:12:22,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 12:12:22,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:22,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:22,109 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:22,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 12:12:22,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 12:12:22,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 12:12:22,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 12:12:22,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2023-04-01 12:12:22,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2023-04-01 12:12:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144262003] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [211781425] [2023-04-01 12:12:27,209 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:27,210 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:27,210 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:27,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2023-04-01 12:12:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728373764] [2023-04-01 12:12:27,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-01 12:12:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-01 12:12:27,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2023-04-01 12:12:27,214 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (28), 10 states have call predecessors, (28), 19 states have call successors, (28) [2023-04-01 12:12:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:27,531 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2023-04-01 12:12:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 12:12:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (28), 10 states have call predecessors, (28), 19 states have call successors, (28) Word has length 749 [2023-04-01 12:12:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:27,539 INFO L225 Difference]: With dead ends: 115 [2023-04-01 12:12:27,539 INFO L226 Difference]: Without dead ends: 111 [2023-04-01 12:12:27,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1527 GetRequests, 1488 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2023-04-01 12:12:27,540 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:27,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 118 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 12:12:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-04-01 12:12:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-04-01 12:12:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 73 states have internal predecessors, (82), 21 states have call successors, (21), 17 states have call predecessors, (21), 12 states have return successors, (55), 20 states have call predecessors, (55), 20 states have call successors, (55) [2023-04-01 12:12:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2023-04-01 12:12:27,568 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 749 [2023-04-01 12:12:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:27,569 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2023-04-01 12:12:27,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (28), 10 states have call predecessors, (28), 19 states have call successors, (28) [2023-04-01 12:12:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2023-04-01 12:12:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1390 [2023-04-01 12:12:27,663 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:27,664 INFO L195 NwaCegarLoop]: trace histogram [203, 203, 164, 101, 101, 101, 101, 101, 101, 101, 63, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:27,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:27,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 12:12:27,873 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:27,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 978372665, now seen corresponding path program 10 times [2023-04-01 12:12:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726062375] [2023-04-01 12:12:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 5811 proven. 3252 refuted. 0 times theorem prover too weak. 106515 trivial. 0 not checked. [2023-04-01 12:12:31,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 12:12:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726062375] [2023-04-01 12:12:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726062375] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 12:12:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565003733] [2023-04-01 12:12:31,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 12:12:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 12:12:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 12:12:31,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 12:12:31,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 12:12:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 12:12:32,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 3113 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 12:12:32,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 12:12:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6850 proven. 3999 refuted. 0 times theorem prover too weak. 104729 trivial. 0 not checked. [2023-04-01 12:12:32,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 12:12:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 115578 backedges. 6850 proven. 4116 refuted. 0 times theorem prover too weak. 104612 trivial. 0 not checked. [2023-04-01 12:12:41,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565003733] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 12:12:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [238369249] [2023-04-01 12:12:41,016 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 12:12:41,016 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 12:12:41,017 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 12:12:41,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 12:12:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2023-04-01 12:12:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409684312] [2023-04-01 12:12:41,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 12:12:41,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 12:12:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 12:12:41,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 12:12:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2023-04-01 12:12:41,020 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (35), 14 states have call predecessors, (35), 21 states have call successors, (35) [2023-04-01 12:12:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 12:12:41,374 INFO L93 Difference]: Finished difference Result 204 states and 367 transitions. [2023-04-01 12:12:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 12:12:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (35), 14 states have call predecessors, (35), 21 states have call successors, (35) Word has length 1389 [2023-04-01 12:12:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 12:12:41,380 INFO L225 Difference]: With dead ends: 204 [2023-04-01 12:12:41,381 INFO L226 Difference]: Without dead ends: 182 [2023-04-01 12:12:41,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2807 GetRequests, 2762 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 12:12:41,383 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 12:12:41,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 222 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 12:12:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-04-01 12:12:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2023-04-01 12:12:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 111 states have internal predecessors, (120), 31 states have call successors, (31), 17 states have call predecessors, (31), 26 states have return successors, (108), 44 states have call predecessors, (108), 30 states have call successors, (108) [2023-04-01 12:12:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2023-04-01 12:12:41,398 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 1389 [2023-04-01 12:12:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 12:12:41,400 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2023-04-01 12:12:41,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (35), 14 states have call predecessors, (35), 21 states have call successors, (35) [2023-04-01 12:12:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2023-04-01 12:12:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2023-04-01 12:12:41,452 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 12:12:41,453 INFO L195 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 12:12:41,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 12:12:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 12:12:41,664 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 12:12:41,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 12:12:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1066164351, now seen corresponding path program 11 times [2023-04-01 12:12:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 12:12:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402271818] [2023-04-01 12:12:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 12:12:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 12:12:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat