/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/recursive/Ackermann03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:00:33,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:00:33,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:00:33,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:00:33,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:00:33,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:00:33,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:00:33,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:00:33,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:00:33,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:00:33,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:00:33,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:00:33,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:00:33,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:00:33,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:00:33,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:00:33,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:00:33,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:00:33,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:00:33,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:00:33,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:00:33,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:00:33,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:00:33,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:00:33,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:00:33,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:00:33,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:00:33,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:00:33,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:00:33,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:00:33,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:00:33,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:00:33,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:00:33,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:00:33,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:00:33,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:00:33,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:00:33,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:00:33,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:00:33,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:00:33,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:00:33,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:00:33,175 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:00:33,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:00:33,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:00:33,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:00:33,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:00:33,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:00:33,179 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:00:33,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:00:33,179 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:00:33,179 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:00:33,180 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:00:33,180 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:00:33,181 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:00:33,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:00:33,181 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:00:33,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:00:33,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:00:33,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:00:33,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:00:33,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:00:33,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:00:33,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:00:33,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:00:33,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:00:33,184 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:00:33,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:00:33,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:00:33,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:00:33,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:00:33,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:00:33,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:00:33,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:00:33,457 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:00:33,458 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:00:33,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2023-04-01 00:00:34,720 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:00:34,883 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:00:34,884 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2023-04-01 00:00:34,889 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea421c35d/e8e818e7a4454248b044857637760ca7/FLAGad6a31da7 [2023-04-01 00:00:34,901 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea421c35d/e8e818e7a4454248b044857637760ca7 [2023-04-01 00:00:34,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:00:34,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:00:34,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:00:34,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:00:34,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:00:34,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:00:34" (1/1) ... [2023-04-01 00:00:34,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b61da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:34, skipping insertion in model container [2023-04-01 00:00:34,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:00:34" (1/1) ... [2023-04-01 00:00:34,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:00:34,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:00:35,043 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/Ackermann03.c[1168,1181] [2023-04-01 00:00:35,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:00:35,059 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:00:35,076 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/Ackermann03.c[1168,1181] [2023-04-01 00:00:35,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:00:35,094 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:00:35,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35 WrapperNode [2023-04-01 00:00:35,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:00:35,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:00:35,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:00:35,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:00:35,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:00:35,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:00:35,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:00:35,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:00:35,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (1/1) ... [2023-04-01 00:00:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:00:35,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:35,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 00:00:35,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 00:00:35,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:00:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:00:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:00:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-04-01 00:00:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:00:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:00:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:00:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:00:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:00:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:00:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:00:35,243 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:00:35,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:00:35,376 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:00:35,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:00:35,390 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:00:35,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:00:35 BoogieIcfgContainer [2023-04-01 00:00:35,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:00:35,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:00:35,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:00:35,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:00:35,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:00:34" (1/3) ... [2023-04-01 00:00:35,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dc305d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:00:35, skipping insertion in model container [2023-04-01 00:00:35,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:00:35" (2/3) ... [2023-04-01 00:00:35,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67dc305d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:00:35, skipping insertion in model container [2023-04-01 00:00:35,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:00:35" (3/3) ... [2023-04-01 00:00:35,399 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2023-04-01 00:00:35,413 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:00:35,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:00:35,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:00:35,456 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;@93c943f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:00:35,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:00:35,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 00:00:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 00:00:35,487 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:35,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:35,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:35,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1966479896, now seen corresponding path program 1 times [2023-04-01 00:00:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:35,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533694939] [2023-04-01 00:00:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:35,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:00:35,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:35,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533694939] [2023-04-01 00:00:35,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533694939] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:00:35,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:00:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:00:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472850680] [2023-04-01 00:00:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:00:35,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:00:35,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:35,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:00:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:00:35,808 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 00:00:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:35,901 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-04-01 00:00:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:00:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-04-01 00:00:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:35,921 INFO L225 Difference]: With dead ends: 42 [2023-04-01 00:00:35,921 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 00:00:35,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:00:35,927 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:35,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:00:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 00:00:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 00:00:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-01 00:00:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-04-01 00:00:35,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2023-04-01 00:00:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:35,980 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-04-01 00:00:35,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 00:00:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-04-01 00:00:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-01 00:00:35,984 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:35,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:35,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:00:35,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:35,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash 771457752, now seen corresponding path program 1 times [2023-04-01 00:00:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678164182] [2023-04-01 00:00:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:00:36,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678164182] [2023-04-01 00:00:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678164182] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351590759] [2023-04-01 00:00:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:36,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:36,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:00:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:36,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 00:00:36,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:00:36,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:00:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351590759] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019077750] [2023-04-01 00:00:36,455 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-04-01 00:00:36,456 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:36,459 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:36,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-04-01 00:00:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183405281] [2023-04-01 00:00:36,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:36,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 00:00:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 00:00:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:00:36,464 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 00:00:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:36,576 INFO L93 Difference]: Finished difference Result 68 states and 118 transitions. [2023-04-01 00:00:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:00:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2023-04-01 00:00:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:36,579 INFO L225 Difference]: With dead ends: 68 [2023-04-01 00:00:36,580 INFO L226 Difference]: Without dead ends: 44 [2023-04-01 00:00:36,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-04-01 00:00:36,582 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:36,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:00:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-01 00:00:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-04-01 00:00:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (28), 11 states have call predecessors, (28), 9 states have call successors, (28) [2023-04-01 00:00:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 69 transitions. [2023-04-01 00:00:36,595 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 69 transitions. Word has length 22 [2023-04-01 00:00:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:36,596 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 69 transitions. [2023-04-01 00:00:36,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 00:00:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2023-04-01 00:00:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-01 00:00:36,599 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:36,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:36,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:36,805 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 00:00:36,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:36,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -623306148, now seen corresponding path program 1 times [2023-04-01 00:00:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015697392] [2023-04-01 00:00:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-01 00:00:37,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015697392] [2023-04-01 00:00:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015697392] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122194824] [2023-04-01 00:00:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:37,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:37,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:37,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:37,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:00:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:37,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:00:37,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-04-01 00:00:37,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-01 00:00:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122194824] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1143076653] [2023-04-01 00:00:37,839 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:37,839 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:37,839 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:37,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2023-04-01 00:00:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530337956] [2023-04-01 00:00:37,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:37,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 00:00:37,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 00:00:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:00:37,846 INFO L87 Difference]: Start difference. First operand 44 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 00:00:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:37,939 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2023-04-01 00:00:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:00:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 48 [2023-04-01 00:00:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:37,943 INFO L225 Difference]: With dead ends: 83 [2023-04-01 00:00:37,943 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 00:00:37,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:00:37,945 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:37,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 87 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:00:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 00:00:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-04-01 00:00:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 17 states have call successors, (17), 6 states have call predecessors, (17), 12 states have return successors, (67), 21 states have call predecessors, (67), 16 states have call successors, (67) [2023-04-01 00:00:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 141 transitions. [2023-04-01 00:00:37,965 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 141 transitions. Word has length 48 [2023-04-01 00:00:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:37,966 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 141 transitions. [2023-04-01 00:00:37,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2023-04-01 00:00:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2023-04-01 00:00:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-04-01 00:00:37,971 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:37,971 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:37,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:38,177 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 00:00:38,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:38,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1238670185, now seen corresponding path program 2 times [2023-04-01 00:00:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199737930] [2023-04-01 00:00:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:38,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 104 proven. 14 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-04-01 00:00:38,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199737930] [2023-04-01 00:00:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199737930] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080976648] [2023-04-01 00:00:38,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:00:38,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:38,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:38,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:00:38,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:00:38,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:00:38,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-01 00:00:38,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 98 proven. 19 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-04-01 00:00:38,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 105 proven. 13 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-04-01 00:00:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080976648] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [820945884] [2023-04-01 00:00:39,031 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:39,031 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:39,032 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:39,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2023-04-01 00:00:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241382364] [2023-04-01 00:00:39,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:39,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:00:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:39,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:00:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:00:39,040 INFO L87 Difference]: Start difference. First operand 79 states and 141 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (15), 9 states have call predecessors, (15), 4 states have call successors, (15) [2023-04-01 00:00:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:39,458 INFO L93 Difference]: Finished difference Result 227 states and 644 transitions. [2023-04-01 00:00:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 00:00:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (15), 9 states have call predecessors, (15), 4 states have call successors, (15) Word has length 82 [2023-04-01 00:00:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:39,473 INFO L225 Difference]: With dead ends: 227 [2023-04-01 00:00:39,474 INFO L226 Difference]: Without dead ends: 156 [2023-04-01 00:00:39,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2023-04-01 00:00:39,479 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:39,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 168 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:00:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-04-01 00:00:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2023-04-01 00:00:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.1) internal successors, (88), 83 states have internal predecessors, (88), 25 states have call successors, (25), 6 states have call predecessors, (25), 24 states have return successors, (209), 40 states have call predecessors, (209), 24 states have call successors, (209) [2023-04-01 00:00:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 322 transitions. [2023-04-01 00:00:39,523 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 322 transitions. Word has length 82 [2023-04-01 00:00:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:39,523 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 322 transitions. [2023-04-01 00:00:39,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 4 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (15), 9 states have call predecessors, (15), 4 states have call successors, (15) [2023-04-01 00:00:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 322 transitions. [2023-04-01 00:00:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-04-01 00:00:39,533 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:39,533 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:39,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:39,738 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 00:00:39,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:39,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -711882447, now seen corresponding path program 3 times [2023-04-01 00:00:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850953821] [2023-04-01 00:00:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 131 proven. 148 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2023-04-01 00:00:40,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:40,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850953821] [2023-04-01 00:00:40,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850953821] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:40,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874812050] [2023-04-01 00:00:40,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:00:40,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:40,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:40,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 00:00:40,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:00:40,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:00:40,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:00:40,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 163 proven. 82 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2023-04-01 00:00:40,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 169 proven. 104 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-04-01 00:00:41,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874812050] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:41,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [464123809] [2023-04-01 00:00:41,477 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:41,477 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:41,477 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:41,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 25 [2023-04-01 00:00:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467554995] [2023-04-01 00:00:41,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:41,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:00:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:00:41,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:00:41,480 INFO L87 Difference]: Start difference. First operand 130 states and 322 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 22 states have internal predecessors, (72), 13 states have call successors, (23), 1 states have call predecessors, (23), 12 states have return successors, (32), 16 states have call predecessors, (32), 13 states have call successors, (32) [2023-04-01 00:00:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:43,873 INFO L93 Difference]: Finished difference Result 779 states and 4407 transitions. [2023-04-01 00:00:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-04-01 00:00:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 22 states have internal predecessors, (72), 13 states have call successors, (23), 1 states have call predecessors, (23), 12 states have return successors, (32), 16 states have call predecessors, (32), 13 states have call successors, (32) Word has length 108 [2023-04-01 00:00:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:43,878 INFO L225 Difference]: With dead ends: 779 [2023-04-01 00:00:43,878 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 00:00:43,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2533 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1928, Invalid=6628, Unknown=0, NotChecked=0, Total=8556 [2023-04-01 00:00:43,908 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:43,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 362 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-01 00:00:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 00:00:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2023-04-01 00:00:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (21), 14 states have call predecessors, (21), 12 states have call successors, (21) [2023-04-01 00:00:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2023-04-01 00:00:43,930 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 108 [2023-04-01 00:00:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:43,931 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2023-04-01 00:00:43,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 22 states have internal predecessors, (72), 13 states have call successors, (23), 1 states have call predecessors, (23), 12 states have return successors, (32), 16 states have call predecessors, (32), 13 states have call successors, (32) [2023-04-01 00:00:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2023-04-01 00:00:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-04-01 00:00:43,937 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:43,937 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:43,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:44,157 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 00:00:44,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:44,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 459620129, now seen corresponding path program 4 times [2023-04-01 00:00:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249541122] [2023-04-01 00:00:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 149 proven. 293 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2023-04-01 00:00:44,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249541122] [2023-04-01 00:00:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249541122] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700183353] [2023-04-01 00:00:44,517 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:00:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:44,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:44,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 00:00:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:44,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 21 conjunts are in the unsatisfiable core [2023-04-01 00:00:44,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-04-01 00:00:44,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2023-04-01 00:00:46,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700183353] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:46,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [969753849] [2023-04-01 00:00:46,227 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:46,228 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:46,228 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:46,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 21 [2023-04-01 00:00:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385937481] [2023-04-01 00:00:46,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:46,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 00:00:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 00:00:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-04-01 00:00:46,231 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 18 states have internal predecessors, (62), 10 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-04-01 00:00:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:46,883 INFO L93 Difference]: Finished difference Result 140 states and 185 transitions. [2023-04-01 00:00:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-01 00:00:46,887 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 18 states have internal predecessors, (62), 10 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 134 [2023-04-01 00:00:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:46,889 INFO L225 Difference]: With dead ends: 140 [2023-04-01 00:00:46,889 INFO L226 Difference]: Without dead ends: 82 [2023-04-01 00:00:46,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 255 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=492, Invalid=1578, Unknown=0, NotChecked=0, Total=2070 [2023-04-01 00:00:46,891 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 52 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:46,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:00:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-04-01 00:00:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2023-04-01 00:00:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 14 states have call successors, (14), 7 states have call predecessors, (14), 11 states have return successors, (23), 16 states have call predecessors, (23), 13 states have call successors, (23) [2023-04-01 00:00:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2023-04-01 00:00:46,906 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 134 [2023-04-01 00:00:46,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:46,906 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2023-04-01 00:00:46,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 18 states have internal predecessors, (62), 10 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-04-01 00:00:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2023-04-01 00:00:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-04-01 00:00:46,908 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:46,908 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:46,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:47,108 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 00:00:47,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:47,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1980204231, now seen corresponding path program 5 times [2023-04-01 00:00:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:47,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061560870] [2023-04-01 00:00:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 439 proven. 281 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2023-04-01 00:00:47,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061560870] [2023-04-01 00:00:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061560870] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487220858] [2023-04-01 00:00:47,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:00:47,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:47,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:47,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 00:00:47,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-04-01 00:00:47,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:00:47,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 35 conjunts are in the unsatisfiable core [2023-04-01 00:00:47,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2023-04-01 00:00:48,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2023-04-01 00:00:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487220858] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362647221] [2023-04-01 00:00:51,409 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:51,410 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:51,410 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:51,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 35 [2023-04-01 00:00:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127478674] [2023-04-01 00:00:51,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:51,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 00:00:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 00:00:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 00:00:51,413 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 14 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (33), 17 states have call predecessors, (33), 14 states have call successors, (33) [2023-04-01 00:00:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:52,617 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2023-04-01 00:00:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-04-01 00:00:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 14 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (33), 17 states have call predecessors, (33), 14 states have call successors, (33) Word has length 160 [2023-04-01 00:00:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:52,621 INFO L225 Difference]: With dead ends: 175 [2023-04-01 00:00:52,621 INFO L226 Difference]: Without dead ends: 112 [2023-04-01 00:00:52,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 301 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1327, Invalid=4993, Unknown=0, NotChecked=0, Total=6320 [2023-04-01 00:00:52,624 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:52,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 298 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:00:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-04-01 00:00:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2023-04-01 00:00:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 16 states have call successors, (16), 7 states have call predecessors, (16), 13 states have return successors, (29), 20 states have call predecessors, (29), 15 states have call successors, (29) [2023-04-01 00:00:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2023-04-01 00:00:52,640 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 160 [2023-04-01 00:00:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:52,641 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2023-04-01 00:00:52,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 29 states have internal predecessors, (75), 14 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (33), 17 states have call predecessors, (33), 14 states have call successors, (33) [2023-04-01 00:00:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2023-04-01 00:00:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-04-01 00:00:52,646 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:52,646 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:52,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 00:00:52,853 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 00:00:52,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:52,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash 756916040, now seen corresponding path program 6 times [2023-04-01 00:00:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:52,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874357216] [2023-04-01 00:00:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 495 proven. 368 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2023-04-01 00:00:53,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874357216] [2023-04-01 00:00:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874357216] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309772031] [2023-04-01 00:00:53,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:00:53,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:53,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:53,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:53,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 00:00:53,652 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:00:53,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:00:53,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-01 00:00:53,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:00:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-04-01 00:00:53,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:00:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2023-04-01 00:00:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309772031] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:00:57,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174945075] [2023-04-01 00:00:57,210 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:00:57,211 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:00:57,211 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:00:57,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:00:57,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 32 [2023-04-01 00:00:57,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198930529] [2023-04-01 00:00:57,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:00:57,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 00:00:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:00:57,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 00:00:57,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:00:57,216 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 15 states have call predecessors, (33), 15 states have call successors, (33) [2023-04-01 00:00:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:00:58,426 INFO L93 Difference]: Finished difference Result 195 states and 260 transitions. [2023-04-01 00:00:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-04-01 00:00:58,427 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 15 states have call predecessors, (33), 15 states have call successors, (33) Word has length 173 [2023-04-01 00:00:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:00:58,429 INFO L225 Difference]: With dead ends: 195 [2023-04-01 00:00:58,429 INFO L226 Difference]: Without dead ends: 122 [2023-04-01 00:00:58,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 326 SyntacticMatches, 23 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1394, Invalid=4926, Unknown=0, NotChecked=0, Total=6320 [2023-04-01 00:00:58,433 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:00:58,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 331 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:00:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-04-01 00:00:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-04-01 00:00:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 56 states have internal predecessors, (61), 17 states have call successors, (17), 7 states have call predecessors, (17), 14 states have return successors, (33), 22 states have call predecessors, (33), 16 states have call successors, (33) [2023-04-01 00:00:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2023-04-01 00:00:58,453 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 173 [2023-04-01 00:00:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:00:58,454 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-04-01 00:00:58,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 15 states have call predecessors, (33), 15 states have call successors, (33) [2023-04-01 00:00:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2023-04-01 00:00:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-04-01 00:00:58,457 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:00:58,457 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:00:58,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 00:00:58,664 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 00:00:58,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:00:58,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:00:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1012489419, now seen corresponding path program 7 times [2023-04-01 00:00:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:00:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816889225] [2023-04-01 00:00:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:00:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:00:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-04-01 00:00:59,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:00:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816889225] [2023-04-01 00:00:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816889225] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:00:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571349225] [2023-04-01 00:00:59,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:00:59,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:00:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:00:59,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:00:59,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:00:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:00:59,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 79 conjunts are in the unsatisfiable core [2023-04-01 00:00:59,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2023-04-01 00:01:00,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-04-01 00:01:01,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571349225] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723579358] [2023-04-01 00:01:01,590 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:01:01,590 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:01,590 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:01,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2023-04-01 00:01:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028401182] [2023-04-01 00:01:01,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:01,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-04-01 00:01:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-04-01 00:01:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 00:01:01,593 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2023-04-01 00:01:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:03,579 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2023-04-01 00:01:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-01 00:01:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 186 [2023-04-01 00:01:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:03,581 INFO L225 Difference]: With dead ends: 178 [2023-04-01 00:01:03,581 INFO L226 Difference]: Without dead ends: 174 [2023-04-01 00:01:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 363 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=568, Invalid=4402, Unknown=0, NotChecked=0, Total=4970 [2023-04-01 00:01:03,584 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 96 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:03,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 529 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 00:01:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-04-01 00:01:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 100. [2023-04-01 00:01:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 65 states have internal predecessors, (72), 20 states have call successors, (20), 8 states have call predecessors, (20), 16 states have return successors, (44), 26 states have call predecessors, (44), 19 states have call successors, (44) [2023-04-01 00:01:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2023-04-01 00:01:03,595 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 186 [2023-04-01 00:01:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:03,596 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2023-04-01 00:01:03,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2023-04-01 00:01:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2023-04-01 00:01:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-04-01 00:01:03,598 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:03,598 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:03,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:03,804 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 00:01:03,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:03,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1701830212, now seen corresponding path program 8 times [2023-04-01 00:01:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784185922] [2023-04-01 00:01:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-04-01 00:01:04,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784185922] [2023-04-01 00:01:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784185922] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679356568] [2023-04-01 00:01:04,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:04,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:04,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:04,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:01:04,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2023-04-01 00:01:04,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:04,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-01 00:01:04,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2023-04-01 00:01:04,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2023-04-01 00:01:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679356568] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1403449613] [2023-04-01 00:01:09,192 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:01:09,192 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:09,193 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:09,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 36 [2023-04-01 00:01:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842224222] [2023-04-01 00:01:09,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:09,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-04-01 00:01:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-04-01 00:01:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 00:01:09,197 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (39), 17 states have call predecessors, (39), 19 states have call successors, (39) [2023-04-01 00:01:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:10,047 INFO L93 Difference]: Finished difference Result 278 states and 382 transitions. [2023-04-01 00:01:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-01 00:01:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (39), 17 states have call predecessors, (39), 19 states have call successors, (39) Word has length 199 [2023-04-01 00:01:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:10,050 INFO L225 Difference]: With dead ends: 278 [2023-04-01 00:01:10,050 INFO L226 Difference]: Without dead ends: 130 [2023-04-01 00:01:10,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 376 SyntacticMatches, 25 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2023-04-01 00:01:10,053 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:10,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 294 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:01:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-04-01 00:01:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2023-04-01 00:01:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 18 states have call successors, (18), 8 states have call predecessors, (18), 15 states have return successors, (40), 24 states have call predecessors, (40), 17 states have call successors, (40) [2023-04-01 00:01:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2023-04-01 00:01:10,064 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 199 [2023-04-01 00:01:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:10,066 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2023-04-01 00:01:10,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 32 states have internal predecessors, (88), 19 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (39), 17 states have call predecessors, (39), 19 states have call successors, (39) [2023-04-01 00:01:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2023-04-01 00:01:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-04-01 00:01:10,068 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:10,068 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:10,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:10,276 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 00:01:10,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:10,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1647649941, now seen corresponding path program 9 times [2023-04-01 00:01:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:10,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100343317] [2023-04-01 00:01:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2023-04-01 00:01:10,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100343317] [2023-04-01 00:01:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100343317] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762743003] [2023-04-01 00:01:10,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:01:10,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:10,711 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:01:11,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:01:11,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:11,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-01 00:01:11,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2023-04-01 00:01:11,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2023-04-01 00:01:13,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762743003] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:13,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412392414] [2023-04-01 00:01:13,192 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:01:13,192 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:13,192 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:13,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 25 [2023-04-01 00:01:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361642723] [2023-04-01 00:01:13,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:01:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:01:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:01:13,195 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 22 states have internal predecessors, (74), 14 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2023-04-01 00:01:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:13,626 INFO L93 Difference]: Finished difference Result 186 states and 252 transitions. [2023-04-01 00:01:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 00:01:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 22 states have internal predecessors, (74), 14 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) Word has length 212 [2023-04-01 00:01:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:13,630 INFO L225 Difference]: With dead ends: 186 [2023-04-01 00:01:13,631 INFO L226 Difference]: Without dead ends: 100 [2023-04-01 00:01:13,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 409 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2023-04-01 00:01:13,633 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 95 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:13,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 242 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:01:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-04-01 00:01:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2023-04-01 00:01:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 17 states have call successors, (17), 8 states have call predecessors, (17), 14 states have return successors, (31), 22 states have call predecessors, (31), 16 states have call successors, (31) [2023-04-01 00:01:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2023-04-01 00:01:13,644 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 212 [2023-04-01 00:01:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:13,645 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2023-04-01 00:01:13,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 22 states have internal predecessors, (74), 14 states have call successors, (22), 2 states have call predecessors, (22), 13 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2023-04-01 00:01:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2023-04-01 00:01:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-04-01 00:01:13,648 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:13,648 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:13,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:13,856 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 00:01:13,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:13,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1382159902, now seen corresponding path program 10 times [2023-04-01 00:01:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:13,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044236058] [2023-04-01 00:01:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 507 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-04-01 00:01:14,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044236058] [2023-04-01 00:01:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044236058] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033475203] [2023-04-01 00:01:14,051 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:01:14,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:14,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:14,052 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:01:14,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:01:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:14,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:01:14,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 507 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2023-04-01 00:01:14,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 522 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2023-04-01 00:01:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033475203] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118626860] [2023-04-01 00:01:15,272 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:01:15,272 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:15,272 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 00:01:15,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 12 [2023-04-01 00:01:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381452733] [2023-04-01 00:01:15,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:15,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 00:01:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 00:01:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-04-01 00:01:15,277 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2023-04-01 00:01:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:15,382 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2023-04-01 00:01:15,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 284 [2023-04-01 00:01:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:15,383 INFO L225 Difference]: With dead ends: 92 [2023-04-01 00:01:15,383 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 00:01:15,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 563 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:15,387 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:15,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 00:01:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 00:01:15,388 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 00:01:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 00:01:15,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2023-04-01 00:01:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:15,389 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 00:01:15,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 9 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2023-04-01 00:01:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 00:01:15,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 00:01:15,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 00:01:15,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 00:01:15,602 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 00:01:15,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 00:01:28,189 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 47) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 27 47) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-04-01 00:01:28,190 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 27 47) the Hoare annotation is: true [2023-04-01 00:01:28,190 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2023-04-01 00:01:28,190 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2023-04-01 00:01:28,191 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (or (< |ackermann_#in~n| 0) (< 0 |ackermann_#in~n|)) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2023-04-01 00:01:28,191 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-04-01 00:01:28,192 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (<= 0 |ackermann_#in~n|) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| 0)) [2023-04-01 00:01:28,192 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse15 (<= |ackermann_#in~n| ackermann_~n)) (.cse13 (= ackermann_~m |ackermann_#in~m|)) (.cse14 (or (= ackermann_~n 1) (= ackermann_~n |ackermann_#in~n|))) (.cse7 (<= 3 |ackermann_#in~n|)) (.cse12 (<= 1 |ackermann_#in~m|)) (.cse9 (<= |ackermann_#in~m| 1))) (let ((.cse1 (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse7 .cse12 .cse9 (<= 4 |ackermann_#t~ret5|))) (.cse3 (<= 5 |ackermann_#t~ret5|)) (.cse4 (<= |ackermann_#t~ret5| 5)) (.cse0 (<= 2 |ackermann_#in~m|)) (.cse11 (<= |ackermann_#in~n| 1)) (.cse6 (and .cse15 (<= 3 |ackermann_#in~m|) .cse13 .cse14)) (.cse2 (and .cse15 (<= 0 |ackermann_#in~m|) .cse13 .cse14 (<= |ackermann_#in~m| 0)))) (and (or (and (<= 6 |ackermann_#t~ret5|) (<= |ackermann_#t~ret5| 6) (<= 5 |ackermann_#in~n|)) .cse0 (<= |ackermann_#in~n| 2) .cse1 .cse2 (and .cse3 .cse4 (<= 4 |ackermann_#in~n|) (<= |ackermann_#in~n| 4)) (and .cse3 (<= 6 |ackermann_#in~n|))) (let ((.cse8 (<= 2 |ackermann_#in~n|)) (.cse5 (<= 1 |ackermann_#in~n|)) (.cse10 (<= |ackermann_#t~ret5| 3))) (or (and (<= |ackermann_#t~ret5| 2) .cse5) .cse6 (and .cse3 .cse7) .cse1 .cse2 (and .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse0 .cse8) (and .cse0 .cse5 .cse10 .cse11))) (or (and (<= 2 |ackermann_#t~ret5|) .cse12 .cse13 .cse14 .cse9 .cse11) .cse6 (and .cse15 (<= 3 |ackermann_#t~ret5|) .cse12 .cse13 .cse14) .cse2)))) [2023-04-01 00:01:28,192 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2023-04-01 00:01:28,192 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-04-01 00:01:28,192 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2023-04-01 00:01:28,192 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-04-01 00:01:28,192 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-04-01 00:01:28,192 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2023-04-01 00:01:28,195 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2023-04-01 00:01:28,197 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 00:01:28,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:01:28 BoogieIcfgContainer [2023-04-01 00:01:28,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 00:01:28,201 INFO L158 Benchmark]: Toolchain (without parser) took 53296.53ms. Allocated memory was 296.7MB in the beginning and 907.0MB in the end (delta: 610.3MB). Free memory was 246.9MB in the beginning and 688.4MB in the end (delta: -441.5MB). Peak memory consumption was 545.9MB. Max. memory is 8.0GB. [2023-04-01 00:01:28,201 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 187.7MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 00:01:28,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.23ms. Allocated memory is still 296.7MB. Free memory was 246.9MB in the beginning and 236.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 00:01:28,201 INFO L158 Benchmark]: Boogie Preprocessor took 20.87ms. Allocated memory is still 296.7MB. Free memory was 236.7MB in the beginning and 235.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 00:01:28,202 INFO L158 Benchmark]: RCFGBuilder took 275.69ms. Allocated memory is still 296.7MB. Free memory was 235.3MB in the beginning and 223.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 00:01:28,202 INFO L158 Benchmark]: TraceAbstraction took 52806.33ms. Allocated memory was 296.7MB in the beginning and 907.0MB in the end (delta: 610.3MB). Free memory was 223.1MB in the beginning and 688.4MB in the end (delta: -465.4MB). Peak memory consumption was 521.8MB. Max. memory is 8.0GB. [2023-04-01 00:01:28,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################