/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive-simple/sum_15x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 06:07:36,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 06:07:36,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 06:07:36,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 06:07:36,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 06:07:36,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 06:07:36,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 06:07:36,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 06:07:36,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 06:07:36,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 06:07:36,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 06:07:36,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 06:07:36,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 06:07:36,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 06:07:36,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 06:07:36,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 06:07:36,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 06:07:36,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 06:07:36,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 06:07:36,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 06:07:36,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 06:07:36,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 06:07:36,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 06:07:36,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 06:07:36,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 06:07:36,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 06:07:36,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 06:07:36,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 06:07:36,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 06:07:36,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 06:07:36,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 06:07:36,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 06:07:36,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 06:07:36,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 06:07:36,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 06:07:36,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 06:07:36,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 06:07:36,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 06:07:36,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 06:07:36,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 06:07:36,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 06:07:36,866 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 06:07:36,896 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 06:07:36,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 06:07:36,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 06:07:36,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 06:07:36,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 06:07:36,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 06:07:36,899 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 06:07:36,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 06:07:36,899 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 06:07:36,899 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 06:07:36,900 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 06:07:36,900 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 06:07:36,901 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 06:07:36,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 06:07:36,901 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 06:07:36,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 06:07:36,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 06:07:36,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 06:07:36,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 06:07:36,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:07:36,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 06:07:36,903 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 06:07:36,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 06:07:36,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 06:07:36,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 06:07:36,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-01 06:07:37,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 06:07:37,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 06:07:37,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 06:07:37,142 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 06:07:37,144 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 06:07:37,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2023-04-01 06:07:38,303 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 06:07:38,488 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 06:07:38,489 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-1.c [2023-04-01 06:07:38,494 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7faf620/1622e1fc9c7e4344825a2d64fddcfe21/FLAG004df0570 [2023-04-01 06:07:38,508 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a7faf620/1622e1fc9c7e4344825a2d64fddcfe21 [2023-04-01 06:07:38,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 06:07:38,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 06:07:38,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 06:07:38,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 06:07:38,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 06:07:38,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c84265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38, skipping insertion in model container [2023-04-01 06:07:38,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 06:07:38,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 06:07:38,686 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/sum_15x0-1.c[481,494] [2023-04-01 06:07:38,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:07:38,701 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 06:07:38,713 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/sum_15x0-1.c[481,494] [2023-04-01 06:07:38,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:07:38,724 INFO L208 MainTranslator]: Completed translation [2023-04-01 06:07:38,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38 WrapperNode [2023-04-01 06:07:38,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 06:07:38,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 06:07:38,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 06:07:38,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 06:07:38,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,748 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 06:07:38,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 06:07:38,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 06:07:38,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 06:07:38,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (1/1) ... [2023-04-01 06:07:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:07:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:38,788 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 06:07:38,800 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 06:07:38,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 06:07:38,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 06:07:38,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 06:07:38,821 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-04-01 06:07:38,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 06:07:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 06:07:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 06:07:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 06:07:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 06:07:38,875 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 06:07:38,876 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 06:07:39,014 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 06:07:39,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 06:07:39,034 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 06:07:39,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:07:39 BoogieIcfgContainer [2023-04-01 06:07:39,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 06:07:39,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 06:07:39,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 06:07:39,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 06:07:39,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 06:07:38" (1/3) ... [2023-04-01 06:07:39,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756a736c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:07:39, skipping insertion in model container [2023-04-01 06:07:39,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:38" (2/3) ... [2023-04-01 06:07:39,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756a736c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:07:39, skipping insertion in model container [2023-04-01 06:07:39,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:07:39" (3/3) ... [2023-04-01 06:07:39,056 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2023-04-01 06:07:39,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 06:07:39,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 06:07:39,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 06:07:39,168 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;@1ff63250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 06:07:39,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 06:07:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 06:07:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 06:07:39,178 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:39,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:39,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:39,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1820399619, now seen corresponding path program 1 times [2023-04-01 06:07:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340636808] [2023-04-01 06:07:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:39,444 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 06:07:39,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340636808] [2023-04-01 06:07:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340636808] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:07:39,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:07:39,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 06:07:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761331180] [2023-04-01 06:07:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:07:39,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 06:07:39,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 06:07:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 06:07:39,484 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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 06:07:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:39,559 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-04-01 06:07:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 06:07:39,561 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 06:07:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:39,570 INFO L225 Difference]: With dead ends: 30 [2023-04-01 06:07:39,570 INFO L226 Difference]: Without dead ends: 18 [2023-04-01 06:07:39,573 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 06:07:39,579 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:39,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-04-01 06:07:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-04-01 06:07:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 06:07:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-04-01 06:07:39,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2023-04-01 06:07:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:39,616 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-04-01 06:07:39,616 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 06:07:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-04-01 06:07:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 06:07:39,619 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:39,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:39,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 06:07:39,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:39,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash 729741253, now seen corresponding path program 1 times [2023-04-01 06:07:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662084193] [2023-04-01 06:07:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 06:07:39,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662084193] [2023-04-01 06:07:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662084193] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539771388] [2023-04-01 06:07:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:39,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:39,826 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 06:07:39,827 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 06:07:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:39,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 06:07:39,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 06:07:39,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 06:07:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539771388] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1579922886] [2023-04-01 06:07:40,112 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:40,113 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:40,116 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 06:07:40,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 06:07:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388965173] [2023-04-01 06:07:40,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 06:07:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 06:07:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 06:07:40,120 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:07:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:40,163 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-04-01 06:07:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 06:07:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 19 [2023-04-01 06:07:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:40,164 INFO L225 Difference]: With dead ends: 25 [2023-04-01 06:07:40,164 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 06:07:40,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 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 06:07:40,166 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:40,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 06:07:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 06:07:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 06:07:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-04-01 06:07:40,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-04-01 06:07:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:40,171 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-04-01 06:07:40,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:07:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-04-01 06:07:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 06:07:40,173 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:40,173 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:40,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 06:07:40,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:40,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:40,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1939692803, now seen corresponding path program 2 times [2023-04-01 06:07:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581706247] [2023-04-01 06:07:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:07:40,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581706247] [2023-04-01 06:07:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581706247] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769480969] [2023-04-01 06:07:40,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:07:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:40,531 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 06:07:40,533 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 06:07:40,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 06:07:40,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:40,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 06:07:40,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:07:40,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:07:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769480969] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:40,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1448879608] [2023-04-01 06:07:40,950 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:40,950 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:40,950 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 06:07:40,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 06:07:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666551504] [2023-04-01 06:07:40,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:40,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 06:07:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 06:07:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 06:07:40,953 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 06:07:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:41,011 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-04-01 06:07:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 06:07:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 25 [2023-04-01 06:07:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:41,012 INFO L225 Difference]: With dead ends: 28 [2023-04-01 06:07:41,012 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 06:07:41,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 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 06:07:41,014 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:41,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 06:07:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-01 06:07:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 06:07:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-04-01 06:07:41,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2023-04-01 06:07:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:41,019 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-04-01 06:07:41,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 06:07:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-04-01 06:07:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 06:07:41,020 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:41,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:41,046 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 06:07:41,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 06:07:41,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:41,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1644674245, now seen corresponding path program 3 times [2023-04-01 06:07:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249731275] [2023-04-01 06:07:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:41,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249731275] [2023-04-01 06:07:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249731275] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:41,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123142929] [2023-04-01 06:07:41,369 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:07:41,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:41,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:41,370 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 06:07:41,372 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 06:07:41,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:07:41,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:41,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 06:07:41,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:41,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 06:07:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123142929] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399384756] [2023-04-01 06:07:41,942 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:41,942 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:41,942 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 06:07:41,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 06:07:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178873463] [2023-04-01 06:07:41,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:41,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 06:07:41,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 06:07:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 06:07:41,944 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 06:07:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:42,022 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-04-01 06:07:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 06:07:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 31 [2023-04-01 06:07:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:42,031 INFO L225 Difference]: With dead ends: 31 [2023-04-01 06:07:42,031 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 06:07:42,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 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 06:07:42,034 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:42,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 06:07:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 06:07:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 06:07:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-04-01 06:07:42,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2023-04-01 06:07:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:42,045 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-04-01 06:07:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 06:07:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-04-01 06:07:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 06:07:42,047 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:42,047 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:42,059 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 06:07:42,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:42,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:42,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:42,253 INFO L85 PathProgramCache]: Analyzing trace with hash 577379837, now seen corresponding path program 4 times [2023-04-01 06:07:42,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814211608] [2023-04-01 06:07:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:42,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 06:07:42,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814211608] [2023-04-01 06:07:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814211608] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248007646] [2023-04-01 06:07:42,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:07:42,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:42,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:42,398 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 06:07:42,399 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 06:07:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:42,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 06:07:42,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 06:07:42,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 06:07:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248007646] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335066020] [2023-04-01 06:07:43,241 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:43,241 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:43,242 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 06:07:43,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2023-04-01 06:07:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684760082] [2023-04-01 06:07:43,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:43,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 06:07:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 06:07:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-04-01 06:07:43,246 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 06:07:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:43,325 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-04-01 06:07:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 06:07:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Word has length 37 [2023-04-01 06:07:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:43,329 INFO L225 Difference]: With dead ends: 34 [2023-04-01 06:07:43,329 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 06:07:43,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2023-04-01 06:07:43,331 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:43,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 06:07:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 06:07:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-04-01 06:07:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-04-01 06:07:43,349 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2023-04-01 06:07:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:43,349 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-04-01 06:07:43,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 06:07:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-04-01 06:07:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 06:07:43,351 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:43,351 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:43,358 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 06:07:43,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:43,557 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:43,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1622883899, now seen corresponding path program 5 times [2023-04-01 06:07:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56607082] [2023-04-01 06:07:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 06:07:43,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56607082] [2023-04-01 06:07:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56607082] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528892441] [2023-04-01 06:07:43,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:07:43,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:43,684 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 06:07:43,687 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 06:07:43,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 06:07:43,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:43,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 06:07:43,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 06:07:43,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528892441] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33297879] [2023-04-01 06:07:44,788 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:44,788 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:44,788 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 06:07:44,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 06:07:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706500793] [2023-04-01 06:07:44,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:44,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 06:07:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 06:07:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 06:07:44,791 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 06:07:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:44,899 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2023-04-01 06:07:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 06:07:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 43 [2023-04-01 06:07:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:44,906 INFO L225 Difference]: With dead ends: 37 [2023-04-01 06:07:44,906 INFO L226 Difference]: Without dead ends: 33 [2023-04-01 06:07:44,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:07:44,907 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:44,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 83 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:07:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-04-01 06:07:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-04-01 06:07:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-01 06:07:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-04-01 06:07:44,917 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2023-04-01 06:07:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:44,918 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-04-01 06:07:44,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 06:07:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-04-01 06:07:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 06:07:44,925 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:44,925 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:44,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:45,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:45,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:45,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash 298146045, now seen corresponding path program 6 times [2023-04-01 06:07:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750174855] [2023-04-01 06:07:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 06:07:45,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750174855] [2023-04-01 06:07:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750174855] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009500383] [2023-04-01 06:07:45,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:07:45,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:45,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:45,269 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 06:07:45,271 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 06:07:45,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:07:45,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:45,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 06:07:45,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 06:07:45,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 06:07:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009500383] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [816116667] [2023-04-01 06:07:46,931 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:46,931 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:46,932 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 06:07:46,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 06:07:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929057091] [2023-04-01 06:07:46,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:46,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 06:07:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:46,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 06:07:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 06:07:46,934 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 06:07:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:47,085 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-04-01 06:07:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 06:07:47,086 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) Word has length 49 [2023-04-01 06:07:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:47,089 INFO L225 Difference]: With dead ends: 40 [2023-04-01 06:07:47,089 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 06:07:47,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 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 06:07:47,090 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:47,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 73 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:07:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 06:07:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 06:07:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-01 06:07:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2023-04-01 06:07:47,101 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2023-04-01 06:07:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:47,101 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2023-04-01 06:07:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 06:07:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2023-04-01 06:07:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 06:07:47,105 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:47,105 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:47,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:47,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:47,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:47,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -788134203, now seen corresponding path program 7 times [2023-04-01 06:07:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751249501] [2023-04-01 06:07:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 06:07:47,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751249501] [2023-04-01 06:07:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751249501] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342865896] [2023-04-01 06:07:47,647 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:07:47,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:47,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:47,658 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 06:07:47,700 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 06:07:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:47,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 06:07:47,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 06:07:47,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-01 06:07:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342865896] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845991958] [2023-04-01 06:07:50,356 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:50,356 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:50,356 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 06:07:50,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2023-04-01 06:07:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062757009] [2023-04-01 06:07:50,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:50,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 06:07:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 06:07:50,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-04-01 06:07:50,359 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 06:07:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:50,502 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2023-04-01 06:07:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 06:07:50,503 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2023-04-01 06:07:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:50,504 INFO L225 Difference]: With dead ends: 43 [2023-04-01 06:07:50,504 INFO L226 Difference]: Without dead ends: 39 [2023-04-01 06:07:50,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2023-04-01 06:07:50,505 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:50,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:07:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-01 06:07:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-04-01 06:07:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-01 06:07:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-04-01 06:07:50,511 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2023-04-01 06:07:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:50,512 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-04-01 06:07:50,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 06:07:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-04-01 06:07:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-01 06:07:50,514 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:50,514 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:50,537 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 06:07:50,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:50,721 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:50,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 849630205, now seen corresponding path program 8 times [2023-04-01 06:07:50,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:50,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147786286] [2023-04-01 06:07:50,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 06:07:50,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147786286] [2023-04-01 06:07:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147786286] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736484189] [2023-04-01 06:07:50,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:07:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:50,958 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 06:07:50,960 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 06:07:51,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-04-01 06:07:51,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:51,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 06:07:51,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 06:07:51,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-01 06:07:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736484189] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935475059] [2023-04-01 06:07:54,553 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:54,553 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:54,554 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 06:07:54,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2023-04-01 06:07:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523758700] [2023-04-01 06:07:54,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:54,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 06:07:54,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 06:07:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:07:54,559 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 06:07:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:54,757 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-04-01 06:07:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 06:07:54,758 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) Word has length 61 [2023-04-01 06:07:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:54,759 INFO L225 Difference]: With dead ends: 46 [2023-04-01 06:07:54,759 INFO L226 Difference]: Without dead ends: 42 [2023-04-01 06:07:54,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2023-04-01 06:07:54,760 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:54,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 119 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:07:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-01 06:07:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-04-01 06:07:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-01 06:07:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2023-04-01 06:07:54,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2023-04-01 06:07:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:54,764 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2023-04-01 06:07:54,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 06:07:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2023-04-01 06:07:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-04-01 06:07:54,767 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:54,767 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:54,776 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 06:07:54,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 06:07:54,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:54,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1226542021, now seen corresponding path program 9 times [2023-04-01 06:07:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220052598] [2023-04-01 06:07:54,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-04-01 06:07:55,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220052598] [2023-04-01 06:07:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220052598] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279313994] [2023-04-01 06:07:55,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:07:55,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:55,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:55,654 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 06:07:55,656 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 06:07:55,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:07:55,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:55,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 06:07:55,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-04-01 06:07:55,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 06:07:59,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279313994] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:59,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806826135] [2023-04-01 06:07:59,892 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:59,892 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:59,892 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 06:07:59,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2023-04-01 06:07:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598847983] [2023-04-01 06:07:59,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:59,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 06:07:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 06:07:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2023-04-01 06:07:59,896 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2023-04-01 06:08:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:00,045 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2023-04-01 06:08:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 06:08:00,045 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) Word has length 67 [2023-04-01 06:08:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:00,046 INFO L225 Difference]: With dead ends: 49 [2023-04-01 06:08:00,046 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 06:08:00,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 06:08:00,047 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:00,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 115 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 06:08:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-01 06:08:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 06:08:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2023-04-01 06:08:00,051 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2023-04-01 06:08:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:00,051 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2023-04-01 06:08:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2023-04-01 06:08:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2023-04-01 06:08:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-01 06:08:00,056 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:00,056 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:00,065 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 06:08:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 06:08:00,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:00,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2033651453, now seen corresponding path program 10 times [2023-04-01 06:08:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255330911] [2023-04-01 06:08:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-04-01 06:08:00,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255330911] [2023-04-01 06:08:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255330911] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174811067] [2023-04-01 06:08:00,680 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:00,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:00,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:00,693 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 06:08:00,769 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 06:08:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:00,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-01 06:08:00,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-04-01 06:08:01,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-04-01 06:08:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174811067] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [402253734] [2023-04-01 06:08:06,279 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:06,279 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:06,279 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 06:08:06,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2023-04-01 06:08:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067807029] [2023-04-01 06:08:06,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:06,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 06:08:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 06:08:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2023-04-01 06:08:06,282 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) [2023-04-01 06:08:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:06,529 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-04-01 06:08:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 06:08:06,530 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) Word has length 73 [2023-04-01 06:08:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:06,531 INFO L225 Difference]: With dead ends: 52 [2023-04-01 06:08:06,531 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 06:08:06,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 06:08:06,532 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:06,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 06:08:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-04-01 06:08:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2023-04-01 06:08:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2023-04-01 06:08:06,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2023-04-01 06:08:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:06,536 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2023-04-01 06:08:06,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) [2023-04-01 06:08:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2023-04-01 06:08:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 06:08:06,539 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:06,539 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:06,548 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 06:08:06,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 06:08:06,745 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:06,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1118482235, now seen corresponding path program 11 times [2023-04-01 06:08:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:06,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176805170] [2023-04-01 06:08:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-04-01 06:08:07,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:07,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176805170] [2023-04-01 06:08:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176805170] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:07,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062288012] [2023-04-01 06:08:07,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:08:07,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:07,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:07,106 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 06:08:07,109 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 06:08:07,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 06:08:07,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:07,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-01 06:08:07,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-04-01 06:08:07,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-04-01 06:08:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062288012] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [720248723] [2023-04-01 06:08:13,185 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:13,185 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:13,186 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 06:08:13,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2023-04-01 06:08:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611880719] [2023-04-01 06:08:13,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 06:08:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 06:08:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-04-01 06:08:13,190 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2023-04-01 06:08:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:13,460 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-04-01 06:08:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 06:08:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) Word has length 79 [2023-04-01 06:08:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:13,462 INFO L225 Difference]: With dead ends: 55 [2023-04-01 06:08:13,462 INFO L226 Difference]: Without dead ends: 51 [2023-04-01 06:08:13,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 06:08:13,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 124 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:13,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 113 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-01 06:08:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-04-01 06:08:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 14 states have return successors, (15), 14 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-01 06:08:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-04-01 06:08:13,467 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2023-04-01 06:08:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:13,468 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-04-01 06:08:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2023-04-01 06:08:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2023-04-01 06:08:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-04-01 06:08:13,469 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:13,469 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:13,491 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 06:08:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 06:08:13,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:13,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -173176323, now seen corresponding path program 12 times [2023-04-01 06:08:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200085630] [2023-04-01 06:08:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-04-01 06:08:14,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200085630] [2023-04-01 06:08:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200085630] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526281934] [2023-04-01 06:08:14,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:08:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:14,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 06:08:14,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:08:14,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:14,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-01 06:08:14,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-04-01 06:08:14,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-04-01 06:08:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526281934] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [536290024] [2023-04-01 06:08:21,919 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:21,919 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:21,919 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 06:08:21,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2023-04-01 06:08:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6291962] [2023-04-01 06:08:21,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:21,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 06:08:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 06:08:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-04-01 06:08:21,922 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) [2023-04-01 06:08:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:22,147 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2023-04-01 06:08:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 06:08:22,147 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) Word has length 85 [2023-04-01 06:08:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:22,148 INFO L225 Difference]: With dead ends: 58 [2023-04-01 06:08:22,148 INFO L226 Difference]: Without dead ends: 54 [2023-04-01 06:08:22,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 156 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 06:08:22,150 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:22,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 133 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-04-01 06:08:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-04-01 06:08:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2023-04-01 06:08:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2023-04-01 06:08:22,154 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2023-04-01 06:08:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:22,154 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2023-04-01 06:08:22,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) [2023-04-01 06:08:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2023-04-01 06:08:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 06:08:22,156 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:22,156 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:22,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 06:08:22,368 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:22,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1199789509, now seen corresponding path program 13 times [2023-04-01 06:08:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:22,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901329959] [2023-04-01 06:08:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-04-01 06:08:22,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901329959] [2023-04-01 06:08:22,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901329959] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266582448] [2023-04-01 06:08:22,938 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:22,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 06:08:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:23,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 06:08:23,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-04-01 06:08:23,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-04-01 06:08:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266582448] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [631813382] [2023-04-01 06:08:32,954 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:32,954 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:32,954 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 06:08:32,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2023-04-01 06:08:32,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25361497] [2023-04-01 06:08:32,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:32,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 06:08:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 06:08:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 06:08:32,960 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) [2023-04-01 06:08:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:33,299 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2023-04-01 06:08:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 06:08:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) Word has length 91 [2023-04-01 06:08:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:33,301 INFO L225 Difference]: With dead ends: 61 [2023-04-01 06:08:33,301 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 06:08:33,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 167 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2023-04-01 06:08:33,302 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 179 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:33,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 153 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 06:08:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-04-01 06:08:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2023-04-01 06:08:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2023-04-01 06:08:33,307 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2023-04-01 06:08:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:33,308 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2023-04-01 06:08:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) [2023-04-01 06:08:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2023-04-01 06:08:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-04-01 06:08:33,312 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:33,312 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:33,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:33,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 06:08:33,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:33,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -734542595, now seen corresponding path program 14 times [2023-04-01 06:08:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:33,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496250158] [2023-04-01 06:08:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-04-01 06:08:34,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496250158] [2023-04-01 06:08:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496250158] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475772139] [2023-04-01 06:08:34,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:08:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:34,165 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:34,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 06:08:34,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-04-01 06:08:34,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:34,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-01 06:08:34,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-04-01 06:08:35,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-04-01 06:08:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475772139] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1074213125] [2023-04-01 06:08:45,838 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:45,838 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:45,838 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 06:08:45,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 34 [2023-04-01 06:08:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950155909] [2023-04-01 06:08:45,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-04-01 06:08:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-04-01 06:08:45,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2023-04-01 06:08:45,841 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (30), 16 states have call predecessors, (30), 17 states have call successors, (30) [2023-04-01 06:08:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:46,134 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2023-04-01 06:08:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 06:08:46,135 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (30), 16 states have call predecessors, (30), 17 states have call successors, (30) Word has length 97 [2023-04-01 06:08:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:46,136 INFO L225 Difference]: With dead ends: 64 [2023-04-01 06:08:46,136 INFO L226 Difference]: Without dead ends: 60 [2023-04-01 06:08:46,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 178 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=800, Invalid=1552, Unknown=0, NotChecked=0, Total=2352 [2023-04-01 06:08:46,137 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 255 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:46,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 137 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-01 06:08:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-04-01 06:08:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2023-04-01 06:08:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2023-04-01 06:08:46,146 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2023-04-01 06:08:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:46,146 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2023-04-01 06:08:46,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (30), 16 states have call predecessors, (30), 17 states have call successors, (30) [2023-04-01 06:08:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2023-04-01 06:08:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-04-01 06:08:46,147 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:46,148 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:46,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:46,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:46,358 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:46,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1702206149, now seen corresponding path program 15 times [2023-04-01 06:08:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725641307] [2023-04-01 06:08:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 273 proven. 128 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-04-01 06:08:48,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725641307] [2023-04-01 06:08:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725641307] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598425272] [2023-04-01 06:08:48,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:08:48,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:48,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:48,639 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:48,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 06:08:49,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:08:49,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:49,553 WARN L260 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 197 conjunts are in the unsatisfiable core [2023-04-01 06:08:49,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2023-04-01 06:08:50,137 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 06:08:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598425272] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:08:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 06:08:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [40] total 43 [2023-04-01 06:08:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958737826] [2023-04-01 06:08:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:08:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 06:08:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 06:08:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2023-04-01 06:08:50,141 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 06:08:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:50,276 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-04-01 06:08:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 06:08:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 103 [2023-04-01 06:08:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:50,277 INFO L225 Difference]: With dead ends: 60 [2023-04-01 06:08:50,277 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 06:08:50,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=1695, Unknown=0, NotChecked=0, Total=1980 [2023-04-01 06:08:50,278 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:50,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:08:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 06:08:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 06:08:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 06:08:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 06:08:50,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2023-04-01 06:08:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:50,280 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 06:08:50,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 06:08:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 06:08:50,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 06:08:50,297 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 06:08:50,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-04-01 06:08:50,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-01 06:08:50,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 06:08:50,527 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-01 06:08:50,527 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-01 06:08:50,527 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 06:08:50,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 06:08:50,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 06:08:50,527 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-01 06:08:50,527 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 06:08:50,527 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point sumEXIT(lines 5 11) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5 11) the Hoare annotation is: true [2023-04-01 06:08:50,528 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point L9-1(line 9) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 10) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point sumFINAL(lines 5 11) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 20) no Hoare annotation was computed. [2023-04-01 06:08:50,528 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2023-04-01 06:08:50,529 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-04-01 06:08:50,529 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (and (= main_~b~0 0) (<= 15 main_~a~0)) [2023-04-01 06:08:50,529 INFO L899 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2023-04-01 06:08:50,529 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 13 20) no Hoare annotation was computed. [2023-04-01 06:08:50,529 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 13 20) the Hoare annotation is: true [2023-04-01 06:08:50,531 INFO L445 BasicCegarLoop]: Path program histogram: [15, 1] [2023-04-01 06:08:50,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 06:08:50,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 06:08:50 BoogieIcfgContainer [2023-04-01 06:08:50,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 06:08:50,537 INFO L158 Benchmark]: Toolchain (without parser) took 72025.15ms. Allocated memory was 219.2MB in the beginning and 791.7MB in the end (delta: 572.5MB). Free memory was 167.5MB in the beginning and 725.5MB in the end (delta: -558.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2023-04-01 06:08:50,537 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 06:08:50,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.27ms. Allocated memory is still 219.2MB. Free memory was 167.5MB in the beginning and 157.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 06:08:50,537 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 219.2MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 06:08:50,538 INFO L158 Benchmark]: RCFGBuilder took 285.97ms. Allocated memory is still 219.2MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 06:08:50,538 INFO L158 Benchmark]: TraceAbstraction took 71498.38ms. Allocated memory was 219.2MB in the beginning and 791.7MB in the end (delta: 572.5MB). Free memory was 144.9MB in the beginning and 725.5MB in the end (delta: -580.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 06:08:50,539 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.27ms. Allocated memory is still 219.2MB. Free memory was 167.5MB in the beginning and 157.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 219.2MB. Free memory was 157.4MB in the beginning and 156.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 285.97ms. Allocated memory is still 219.2MB. Free memory was 156.0MB in the beginning and 145.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 71498.38ms. Allocated memory was 219.2MB in the beginning and 791.7MB in the end (delta: 572.5MB). Free memory was 144.9MB in the beginning and 725.5MB in the end (delta: -580.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.4s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1142 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 991 mSDsluCounter, 1449 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1273 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 176 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2172 GetRequests, 1605 SyntacticMatches, 122 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 19 HoareAnnotationTreeSize, 9 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 60.5s InterpolantComputationTime, 1843 NumberOfCodeBlocks, 1843 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 2610 ConstructedInterpolants, 0 QuantifiedInterpolants, 8505 SizeOfPredicates, 154 NumberOfNonLiveVariables, 3120 ConjunctsInSsa, 463 ConjunctsInUnsatCore, 45 InterpolantComputations, 2 PerfectInterpolantSequences, 4962/10830 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-01 06:08:50,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...