/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:16:43,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:16:43,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:16:43,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:16:43,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:16:43,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:16:43,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:16:43,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:16:43,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:16:43,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:16:43,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:16:43,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:16:43,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:16:43,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:16:43,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:16:43,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:16:43,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:16:43,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:16:43,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:16:43,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:16:43,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:16:43,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:16:43,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:16:43,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:16:43,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:16:43,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:16:43,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:16:43,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:16:43,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:16:43,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:16:43,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:16:43,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:16:43,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:16:43,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:16:43,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:16:43,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:16:43,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:16:43,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:16:43,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:16:43,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:16:43,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:16:43,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-03 01:16:43,878 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:16:43,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:16:43,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:16:43,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:16:43,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:16:43,879 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:16:43,879 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:16:43,880 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:16:43,880 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:16:43,880 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:16:43,880 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:16:43,880 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:16:43,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:16:43,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:16:43,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:16:43,884 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:16:43,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:16:43,884 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:16:43,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:16:43,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:16:43,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:16:43,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:16:43,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:16:43,885 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:16:43,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:16:43,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-03 01:16:44,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:16:44,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:16:44,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:16:44,139 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:16:44,140 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:16:44,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2023-04-03 01:16:45,094 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:16:45,228 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:16:45,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c [2023-04-03 01:16:45,234 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d3e7e5c/ca0526d10f1846f9996a0812c45fa4fe/FLAG0428fcdc1 [2023-04-03 01:16:45,246 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d3e7e5c/ca0526d10f1846f9996a0812c45fa4fe [2023-04-03 01:16:45,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:16:45,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:16:45,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:16:45,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:16:45,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:16:45,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc27b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45, skipping insertion in model container [2023-04-03 01:16:45,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:16:45,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:16:45,385 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c[947,960] [2023-04-03 01:16:45,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:16:45,395 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:16:45,404 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-1.c[947,960] [2023-04-03 01:16:45,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:16:45,413 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:16:45,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45 WrapperNode [2023-04-03 01:16:45,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:16:45,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:16:45,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:16:45,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:16:45,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,430 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:16:45,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:16:45,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:16:45,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:16:45,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (1/1) ... [2023-04-03 01:16:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:16:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:45,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-03 01:16:45,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-03 01:16:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:16:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:16:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:16:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-03 01:16:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-03 01:16:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:16:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:16:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:16:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:16:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:16:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:16:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:16:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:16:45,536 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:16:45,538 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:16:45,655 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:16:45,674 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:16:45,675 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-03 01:16:45,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:16:45 BoogieIcfgContainer [2023-04-03 01:16:45,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:16:45,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:16:45,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:16:45,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:16:45,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:16:45" (1/3) ... [2023-04-03 01:16:45,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b7a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:16:45, skipping insertion in model container [2023-04-03 01:16:45,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:16:45" (2/3) ... [2023-04-03 01:16:45,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b7a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:16:45, skipping insertion in model container [2023-04-03 01:16:45,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:16:45" (3/3) ... [2023-04-03 01:16:45,683 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-1.c [2023-04-03 01:16:45,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:16:45,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:16:45,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:16:45,755 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;@6e769f08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:16:45,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:16:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-03 01:16:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-03 01:16:45,764 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:45,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:45,765 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:45,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-03 01:16:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554847360] [2023-04-03 01:16:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:16:45,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554847360] [2023-04-03 01:16:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554847360] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:45,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:16:45,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:16:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623208679] [2023-04-03 01:16:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:16:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:16:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:16:45,980 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:46,070 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-04-03 01:16:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:16:46,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-03 01:16:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:46,076 INFO L225 Difference]: With dead ends: 42 [2023-04-03 01:16:46,076 INFO L226 Difference]: Without dead ends: 30 [2023-04-03 01:16:46,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:16:46,080 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:46,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-03 01:16:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-03 01:16:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-03 01:16:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-03 01:16:46,113 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-03 01:16:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:46,114 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-03 01:16:46,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-03 01:16:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-03 01:16:46,116 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:46,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:46,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:16:46,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:46,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-03 01:16:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11168589] [2023-04-03 01:16:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:16:46,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11168589] [2023-04-03 01:16:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11168589] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:16:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:16:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966051535] [2023-04-03 01:16:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:46,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:16:46,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:16:46,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:16:46,191 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:46,244 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-03 01:16:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:16:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-04-03 01:16:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:46,245 INFO L225 Difference]: With dead ends: 36 [2023-04-03 01:16:46,245 INFO L226 Difference]: Without dead ends: 32 [2023-04-03 01:16:46,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:16:46,247 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:46,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:16:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-03 01:16:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-03 01:16:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-03 01:16:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-03 01:16:46,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-03 01:16:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:46,252 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-03 01:16:46,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:16:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-03 01:16:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-03 01:16:46,254 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:46,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-03 01:16:46,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:46,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-03 01:16:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294029165] [2023-04-03 01:16:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-03 01:16:46,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294029165] [2023-04-03 01:16:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294029165] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231671766] [2023-04-03 01:16:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:46,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:46,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:46,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:46,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-03 01:16:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:46,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:16:46,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-03 01:16:46,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-03 01:16:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231671766] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010792497] [2023-04-03 01:16:46,698 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-03 01:16:46,698 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:46,701 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-03 01:16:46,704 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-03 01:16:46,704 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-03 01:16:46,779 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 9 for LOIs [2023-04-03 01:16:46,823 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 12 for LOIs [2023-04-03 01:16:46,838 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 12 for LOIs [2023-04-03 01:16:46,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-03 01:16:46,848 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-03 01:16:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2010792497] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:16:46,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:46,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 7, 7] total 20 [2023-04-03 01:16:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264099177] [2023-04-03 01:16:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:16:46,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-03 01:16:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-03 01:16:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:16:46,998 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-03 01:16:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:47,497 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-03 01:16:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-03 01:16:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-03 01:16:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:47,502 INFO L225 Difference]: With dead ends: 72 [2023-04-03 01:16:47,502 INFO L226 Difference]: Without dead ends: 48 [2023-04-03 01:16:47,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:16:47,513 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:47,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-03 01:16:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-03 01:16:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-03 01:16:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-03 01:16:47,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-03 01:16:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:47,523 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-03 01:16:47,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-03 01:16:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-03 01:16:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-03 01:16:47,524 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:47,524 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:47,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:47,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:47,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-03 01:16:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440883140] [2023-04-03 01:16:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-03 01:16:47,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440883140] [2023-04-03 01:16:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440883140] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687232525] [2023-04-03 01:16:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:47,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:47,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:47,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:47,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-03 01:16:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:47,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:47,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-03 01:16:47,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:16:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687232525] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094034578] [2023-04-03 01:16:48,175 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:48,175 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:48,176 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:48,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-03 01:16:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868478024] [2023-04-03 01:16:48,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:48,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-03 01:16:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:48,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-03 01:16:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:16:48,179 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-03 01:16:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:48,347 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-03 01:16:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:16:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2023-04-03 01:16:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:48,351 INFO L225 Difference]: With dead ends: 89 [2023-04-03 01:16:48,351 INFO L226 Difference]: Without dead ends: 57 [2023-04-03 01:16:48,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:16:48,354 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:48,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-03 01:16:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-03 01:16:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-03 01:16:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-03 01:16:48,376 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-03 01:16:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:48,376 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-03 01:16:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-03 01:16:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-03 01:16:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-03 01:16:48,377 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:48,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:48,393 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-03 01:16:48,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-03 01:16:48,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:48,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-03 01:16:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871454602] [2023-04-03 01:16:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-03 01:16:48,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871454602] [2023-04-03 01:16:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871454602] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547518525] [2023-04-03 01:16:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:48,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:48,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:48,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:48,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-03 01:16:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:48,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:16:48,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-03 01:16:48,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:16:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547518525] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:49,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085451184] [2023-04-03 01:16:49,078 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:49,078 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:49,078 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:49,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-04-03 01:16:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132197050] [2023-04-03 01:16:49,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:49,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-03 01:16:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-03 01:16:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-04-03 01:16:49,080 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-03 01:16:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:49,438 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-03 01:16:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-03 01:16:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2023-04-03 01:16:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:49,443 INFO L225 Difference]: With dead ends: 125 [2023-04-03 01:16:49,443 INFO L226 Difference]: Without dead ends: 81 [2023-04-03 01:16:49,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-04-03 01:16:49,447 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:49,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:16:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-03 01:16:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-03 01:16:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2023-04-03 01:16:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-03 01:16:49,475 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-03 01:16:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:49,475 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-03 01:16:49,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-03 01:16:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-03 01:16:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-03 01:16:49,483 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:49,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:49,490 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-03 01:16:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:49,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:49,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-03 01:16:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138724260] [2023-04-03 01:16:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-03 01:16:49,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138724260] [2023-04-03 01:16:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138724260] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458558804] [2023-04-03 01:16:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:49,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:49,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-03 01:16:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:49,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:16:49,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-03 01:16:49,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-03 01:16:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458558804] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59543638] [2023-04-03 01:16:50,220 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:50,220 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:50,220 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:50,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:50,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2023-04-03 01:16:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727641599] [2023-04-03 01:16:50,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:50,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-03 01:16:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:50,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-03 01:16:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:16:50,222 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-03 01:16:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:50,385 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-04-03 01:16:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-03 01:16:50,386 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 54 [2023-04-03 01:16:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:50,387 INFO L225 Difference]: With dead ends: 123 [2023-04-03 01:16:50,387 INFO L226 Difference]: Without dead ends: 101 [2023-04-03 01:16:50,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2023-04-03 01:16:50,388 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 117 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-03 01:16:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2023-04-03 01:16:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 12 states have return successors, (40), 18 states have call predecessors, (40), 15 states have call successors, (40) [2023-04-03 01:16:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2023-04-03 01:16:50,399 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 54 [2023-04-03 01:16:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:50,400 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2023-04-03 01:16:50,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-03 01:16:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2023-04-03 01:16:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-04-03 01:16:50,401 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:50,401 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:50,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:50,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:50,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:50,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1187443411, now seen corresponding path program 1 times [2023-04-03 01:16:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368673154] [2023-04-03 01:16:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-04-03 01:16:50,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368673154] [2023-04-03 01:16:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368673154] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088385336] [2023-04-03 01:16:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:50,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:50,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-03 01:16:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:50,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-03 01:16:50,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-04-03 01:16:50,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-04-03 01:16:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088385336] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642789615] [2023-04-03 01:16:51,483 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:51,483 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:51,483 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:51,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2023-04-03 01:16:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872339831] [2023-04-03 01:16:51,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-03 01:16:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-03 01:16:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:16:51,485 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-03 01:16:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:52,016 INFO L93 Difference]: Finished difference Result 208 states and 415 transitions. [2023-04-03 01:16:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-03 01:16:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 96 [2023-04-03 01:16:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:52,019 INFO L225 Difference]: With dead ends: 208 [2023-04-03 01:16:52,019 INFO L226 Difference]: Without dead ends: 119 [2023-04-03 01:16:52,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2023-04-03 01:16:52,020 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 79 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:52,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:16:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-04-03 01:16:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2023-04-03 01:16:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 21 states have call successors, (21), 10 states have call predecessors, (21), 15 states have return successors, (51), 24 states have call predecessors, (51), 20 states have call successors, (51) [2023-04-03 01:16:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2023-04-03 01:16:52,035 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 96 [2023-04-03 01:16:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:52,036 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2023-04-03 01:16:52,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-03 01:16:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2023-04-03 01:16:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-04-03 01:16:52,037 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:52,038 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 10, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:52,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:52,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:52,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:52,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1368434034, now seen corresponding path program 2 times [2023-04-03 01:16:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270280367] [2023-04-03 01:16:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 49 proven. 168 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-04-03 01:16:52,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270280367] [2023-04-03 01:16:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270280367] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315865716] [2023-04-03 01:16:52,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:16:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:52,377 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:52,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-03 01:16:52,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-03 01:16:52,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:52,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-03 01:16:52,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 38 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-04-03 01:16:52,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-04-03 01:16:53,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315865716] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:53,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1145048007] [2023-04-03 01:16:53,234 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:53,234 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:53,235 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:53,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 20 [2023-04-03 01:16:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697238960] [2023-04-03 01:16:53,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:53,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-03 01:16:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-03 01:16:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:16:53,237 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-03 01:16:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:53,564 INFO L93 Difference]: Finished difference Result 230 states and 413 transitions. [2023-04-03 01:16:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-03 01:16:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 188 [2023-04-03 01:16:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:53,565 INFO L225 Difference]: With dead ends: 230 [2023-04-03 01:16:53,565 INFO L226 Difference]: Without dead ends: 128 [2023-04-03 01:16:53,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 358 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2023-04-03 01:16:53,568 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:53,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:16:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-04-03 01:16:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2023-04-03 01:16:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 24 states have call successors, (24), 11 states have call predecessors, (24), 17 states have return successors, (56), 27 states have call predecessors, (56), 23 states have call successors, (56) [2023-04-03 01:16:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2023-04-03 01:16:53,593 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 188 [2023-04-03 01:16:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:53,593 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2023-04-03 01:16:53,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-03 01:16:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2023-04-03 01:16:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-04-03 01:16:53,596 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:53,596 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:53,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:53,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:53,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:53,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1236166869, now seen corresponding path program 3 times [2023-04-03 01:16:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:53,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815880197] [2023-04-03 01:16:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 42 proven. 158 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2023-04-03 01:16:53,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815880197] [2023-04-03 01:16:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815880197] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222740901] [2023-04-03 01:16:53,927 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:16:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:53,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:53,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-03 01:16:53,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:16:53,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:53,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:16:53,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 29 proven. 212 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2023-04-03 01:16:54,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 29 proven. 228 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-04-03 01:16:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222740901] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1522940388] [2023-04-03 01:16:54,970 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:54,970 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:54,970 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:54,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:54,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 23 [2023-04-03 01:16:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012030522] [2023-04-03 01:16:54,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-03 01:16:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-03 01:16:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:16:54,972 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (31), 12 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-03 01:16:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:55,194 INFO L93 Difference]: Finished difference Result 174 states and 313 transitions. [2023-04-03 01:16:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-03 01:16:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (31), 12 states have call predecessors, (31), 18 states have call successors, (31) Word has length 149 [2023-04-03 01:16:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:55,197 INFO L225 Difference]: With dead ends: 174 [2023-04-03 01:16:55,197 INFO L226 Difference]: Without dead ends: 148 [2023-04-03 01:16:55,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 283 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2023-04-03 01:16:55,198 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:55,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 162 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-04-03 01:16:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2023-04-03 01:16:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 86 states have internal predecessors, (96), 26 states have call successors, (26), 11 states have call predecessors, (26), 21 states have return successors, (75), 33 states have call predecessors, (75), 25 states have call successors, (75) [2023-04-03 01:16:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2023-04-03 01:16:55,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 149 [2023-04-03 01:16:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:55,211 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2023-04-03 01:16:55,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (31), 12 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-03 01:16:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2023-04-03 01:16:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2023-04-03 01:16:55,214 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:55,214 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 21, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:55,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:55,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:55,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:55,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1280383549, now seen corresponding path program 4 times [2023-04-03 01:16:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311182185] [2023-04-03 01:16:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3232 backedges. 104 proven. 708 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2023-04-03 01:16:55,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311182185] [2023-04-03 01:16:55,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311182185] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:55,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523681183] [2023-04-03 01:16:55,720 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:16:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:55,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:55,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:55,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-03 01:16:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:55,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-03 01:16:55,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3232 backedges. 104 proven. 708 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2023-04-03 01:16:55,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3232 backedges. 104 proven. 732 refuted. 0 times theorem prover too weak. 2396 trivial. 0 not checked. [2023-04-03 01:16:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523681183] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [203581834] [2023-04-03 01:16:57,453 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:57,453 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:57,453 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:57,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2023-04-03 01:16:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483595561] [2023-04-03 01:16:57,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-03 01:16:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-03 01:16:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:16:57,456 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 16 states have call successors, (24) [2023-04-03 01:16:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:57,614 INFO L93 Difference]: Finished difference Result 161 states and 264 transitions. [2023-04-03 01:16:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-03 01:16:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 16 states have call successors, (24) Word has length 342 [2023-04-03 01:16:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:57,617 INFO L225 Difference]: With dead ends: 161 [2023-04-03 01:16:57,617 INFO L226 Difference]: Without dead ends: 147 [2023-04-03 01:16:57,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 675 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:16:57,619 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:57,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 162 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-04-03 01:16:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2023-04-03 01:16:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.1625) internal successors, (93), 83 states have internal predecessors, (93), 25 states have call successors, (25), 11 states have call predecessors, (25), 20 states have return successors, (66), 31 states have call predecessors, (66), 24 states have call successors, (66) [2023-04-03 01:16:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2023-04-03 01:16:57,633 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 342 [2023-04-03 01:16:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:57,633 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2023-04-03 01:16:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 16 states have call successors, (24) [2023-04-03 01:16:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2023-04-03 01:16:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-04-03 01:16:57,637 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:57,637 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 24, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 10, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:57,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:57,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-03 01:16:57,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:57,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 706939376, now seen corresponding path program 5 times [2023-04-03 01:16:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650835241] [2023-04-03 01:16:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:16:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 186 proven. 789 refuted. 0 times theorem prover too weak. 3680 trivial. 0 not checked. [2023-04-03 01:16:58,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:16:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650835241] [2023-04-03 01:16:58,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650835241] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:16:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124140739] [2023-04-03 01:16:58,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:16:58,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:58,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:16:58,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:16:58,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-03 01:16:58,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-03 01:16:58,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:16:58,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-03 01:16:58,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:16:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 606 proven. 92 refuted. 0 times theorem prover too weak. 3957 trivial. 0 not checked. [2023-04-03 01:16:58,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:16:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 608 proven. 100 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2023-04-03 01:16:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124140739] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:16:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971030690] [2023-04-03 01:16:59,505 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:16:59,505 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:16:59,506 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:16:59,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:16:59,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 18 [2023-04-03 01:16:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138737707] [2023-04-03 01:16:59,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:16:59,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-03 01:16:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:16:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-03 01:16:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-04-03 01:16:59,508 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2023-04-03 01:16:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:16:59,691 INFO L93 Difference]: Finished difference Result 184 states and 316 transitions. [2023-04-03 01:16:59,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-03 01:16:59,692 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) Word has length 407 [2023-04-03 01:16:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:16:59,694 INFO L225 Difference]: With dead ends: 184 [2023-04-03 01:16:59,694 INFO L226 Difference]: Without dead ends: 170 [2023-04-03 01:16:59,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 808 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:16:59,695 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:16:59,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 143 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:16:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-04-03 01:16:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2023-04-03 01:16:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 94 states have internal predecessors, (104), 28 states have call successors, (28), 11 states have call predecessors, (28), 24 states have return successors, (89), 38 states have call predecessors, (89), 27 states have call successors, (89) [2023-04-03 01:16:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 221 transitions. [2023-04-03 01:16:59,708 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 221 transitions. Word has length 407 [2023-04-03 01:16:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:16:59,708 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 221 transitions. [2023-04-03 01:16:59,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 13 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2023-04-03 01:16:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 221 transitions. [2023-04-03 01:16:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2023-04-03 01:16:59,712 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:16:59,712 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 23, 22, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 10, 7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:16:59,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-03 01:16:59,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:16:59,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:16:59,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:16:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 776081909, now seen corresponding path program 6 times [2023-04-03 01:16:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:16:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042597502] [2023-04-03 01:16:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:16:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:16:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 192 proven. 640 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2023-04-03 01:17:00,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042597502] [2023-04-03 01:17:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042597502] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852151390] [2023-04-03 01:17:00,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:17:00,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:00,199 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:00,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-03 01:17:00,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:17:00,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:00,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:17:00,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 192 proven. 640 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2023-04-03 01:17:00,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 192 proven. 656 refuted. 0 times theorem prover too weak. 3512 trivial. 0 not checked. [2023-04-03 01:17:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852151390] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1292103299] [2023-04-03 01:17:01,705 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:01,705 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:01,705 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:01,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2023-04-03 01:17:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604340009] [2023-04-03 01:17:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:01,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-03 01:17:01,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-03 01:17:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:17:01,707 INFO L87 Difference]: Start difference. First operand 144 states and 221 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-03 01:17:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:01,849 INFO L93 Difference]: Finished difference Result 187 states and 340 transitions. [2023-04-03 01:17:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:17:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) Word has length 394 [2023-04-03 01:17:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:01,853 INFO L225 Difference]: With dead ends: 187 [2023-04-03 01:17:01,853 INFO L226 Difference]: Without dead ends: 173 [2023-04-03 01:17:01,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 780 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:17:01,854 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:01,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 137 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:17:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-04-03 01:17:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2023-04-03 01:17:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 93 states have internal predecessors, (103), 27 states have call successors, (27), 11 states have call predecessors, (27), 24 states have return successors, (88), 37 states have call predecessors, (88), 26 states have call successors, (88) [2023-04-03 01:17:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 218 transitions. [2023-04-03 01:17:01,872 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 218 transitions. Word has length 394 [2023-04-03 01:17:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 218 transitions. [2023-04-03 01:17:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 9 states have call predecessors, (22), 13 states have call successors, (22) [2023-04-03 01:17:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 218 transitions. [2023-04-03 01:17:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2023-04-03 01:17:01,875 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:01,875 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 28, 28, 27, 23, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:01,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:02,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-03 01:17:02,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:02,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2137588092, now seen corresponding path program 7 times [2023-04-03 01:17:02,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190930295] [2023-04-03 01:17:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 278 proven. 591 refuted. 0 times theorem prover too weak. 3891 trivial. 0 not checked. [2023-04-03 01:17:02,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190930295] [2023-04-03 01:17:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190930295] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315694432] [2023-04-03 01:17:02,406 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:17:02,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:02,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:02,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:02,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-03 01:17:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:02,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-03 01:17:02,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 275 proven. 739 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2023-04-03 01:17:02,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 279 proven. 758 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2023-04-03 01:17:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315694432] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1820520858] [2023-04-03 01:17:04,343 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:04,343 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:04,343 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:04,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 28 [2023-04-03 01:17:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381937791] [2023-04-03 01:17:04,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:04,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-04-03 01:17:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-04-03 01:17:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2023-04-03 01:17:04,346 INFO L87 Difference]: Start difference. First operand 142 states and 218 transitions. Second operand has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (36), 17 states have call predecessors, (36), 21 states have call successors, (36) [2023-04-03 01:17:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:05,269 INFO L93 Difference]: Finished difference Result 423 states and 995 transitions. [2023-04-03 01:17:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-03 01:17:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (36), 17 states have call predecessors, (36), 21 states have call successors, (36) Word has length 411 [2023-04-03 01:17:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:05,272 INFO L225 Difference]: With dead ends: 423 [2023-04-03 01:17:05,272 INFO L226 Difference]: Without dead ends: 221 [2023-04-03 01:17:05,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 802 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=410, Invalid=2560, Unknown=0, NotChecked=0, Total=2970 [2023-04-03 01:17:05,276 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 166 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:05,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 486 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-03 01:17:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-04-03 01:17:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 179. [2023-04-03 01:17:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 116 states have internal predecessors, (134), 36 states have call successors, (36), 19 states have call predecessors, (36), 25 states have return successors, (125), 43 states have call predecessors, (125), 35 states have call successors, (125) [2023-04-03 01:17:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 295 transitions. [2023-04-03 01:17:05,294 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 295 transitions. Word has length 411 [2023-04-03 01:17:05,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:05,294 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 295 transitions. [2023-04-03 01:17:05,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.576923076923077) internal successors, (93), 28 states have internal predecessors, (93), 21 states have call successors, (30), 1 states have call predecessors, (30), 14 states have return successors, (36), 17 states have call predecessors, (36), 21 states have call successors, (36) [2023-04-03 01:17:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 295 transitions. [2023-04-03 01:17:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2023-04-03 01:17:05,297 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:05,297 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 22, 20, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:05,302 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-03 01:17:05,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-03 01:17:05,503 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:05,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -16778833, now seen corresponding path program 8 times [2023-04-03 01:17:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823920164] [2023-04-03 01:17:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 196 proven. 567 refuted. 0 times theorem prover too weak. 2986 trivial. 0 not checked. [2023-04-03 01:17:05,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823920164] [2023-04-03 01:17:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823920164] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307042449] [2023-04-03 01:17:05,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:17:05,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:05,731 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:05,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-03 01:17:05,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-04-03 01:17:05,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:05,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:17:05,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 771 proven. 96 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-04-03 01:17:05,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 771 proven. 99 refuted. 0 times theorem prover too weak. 2879 trivial. 0 not checked. [2023-04-03 01:17:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307042449] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:06,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [724550784] [2023-04-03 01:17:06,969 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:06,969 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:06,969 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:06,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 26 [2023-04-03 01:17:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634797034] [2023-04-03 01:17:06,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:06,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-03 01:17:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-03 01:17:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:17:06,971 INFO L87 Difference]: Start difference. First operand 179 states and 295 transitions. Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 17 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 17 states have call predecessors, (34), 17 states have call successors, (34) [2023-04-03 01:17:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:07,695 INFO L93 Difference]: Finished difference Result 533 states and 1152 transitions. [2023-04-03 01:17:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-04-03 01:17:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 17 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 17 states have call predecessors, (34), 17 states have call successors, (34) Word has length 367 [2023-04-03 01:17:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:07,699 INFO L225 Difference]: With dead ends: 533 [2023-04-03 01:17:07,699 INFO L226 Difference]: Without dead ends: 336 [2023-04-03 01:17:07,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 717 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=456, Invalid=2300, Unknown=0, NotChecked=0, Total=2756 [2023-04-03 01:17:07,702 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 151 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:07,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 265 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-03 01:17:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-04-03 01:17:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 259. [2023-04-03 01:17:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 171 states have (on average 1.1754385964912282) internal successors, (201), 167 states have internal predecessors, (201), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (260), 62 states have call predecessors, (260), 54 states have call successors, (260) [2023-04-03 01:17:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 516 transitions. [2023-04-03 01:17:07,728 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 516 transitions. Word has length 367 [2023-04-03 01:17:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:07,729 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 516 transitions. [2023-04-03 01:17:07,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 17 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 17 states have call predecessors, (34), 17 states have call successors, (34) [2023-04-03 01:17:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 516 transitions. [2023-04-03 01:17:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2023-04-03 01:17:07,733 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:07,733 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 37, 37, 34, 29, 22, 22, 22, 22, 22, 22, 22, 18, 18, 18, 18, 18, 18, 18, 16, 10, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:07,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:07,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-03 01:17:07,938 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:07,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 815100075, now seen corresponding path program 9 times [2023-04-03 01:17:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444335484] [2023-04-03 01:17:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8951 backedges. 538 proven. 542 refuted. 0 times theorem prover too weak. 7871 trivial. 0 not checked. [2023-04-03 01:17:08,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444335484] [2023-04-03 01:17:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444335484] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:08,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502143634] [2023-04-03 01:17:08,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:17:08,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:08,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:08,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-03 01:17:08,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:17:08,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:08,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-03 01:17:08,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8951 backedges. 304 proven. 1314 refuted. 0 times theorem prover too weak. 7333 trivial. 0 not checked. [2023-04-03 01:17:08,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8951 backedges. 308 proven. 1340 refuted. 0 times theorem prover too weak. 7303 trivial. 0 not checked. [2023-04-03 01:17:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502143634] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295390349] [2023-04-03 01:17:10,774 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:10,774 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:10,774 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:10,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 26 [2023-04-03 01:17:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901634090] [2023-04-03 01:17:10,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:10,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-04-03 01:17:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:10,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-04-03 01:17:10,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2023-04-03 01:17:10,777 INFO L87 Difference]: Start difference. First operand 259 states and 516 transitions. Second operand has 26 states, 25 states have (on average 3.36) internal successors, (84), 26 states have internal predecessors, (84), 18 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2023-04-03 01:17:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:11,145 INFO L93 Difference]: Finished difference Result 406 states and 1020 transitions. [2023-04-03 01:17:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-03 01:17:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.36) internal successors, (84), 26 states have internal predecessors, (84), 18 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) Word has length 556 [2023-04-03 01:17:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:11,150 INFO L225 Difference]: With dead ends: 406 [2023-04-03 01:17:11,150 INFO L226 Difference]: Without dead ends: 246 [2023-04-03 01:17:11,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1136 GetRequests, 1093 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2023-04-03 01:17:11,155 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:11,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 353 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:17:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-04-03 01:17:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 236. [2023-04-03 01:17:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 152 states have internal predecessors, (182), 48 states have call successors, (48), 29 states have call predecessors, (48), 29 states have return successors, (156), 54 states have call predecessors, (156), 47 states have call successors, (156) [2023-04-03 01:17:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2023-04-03 01:17:11,179 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 556 [2023-04-03 01:17:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:11,179 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2023-04-03 01:17:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.36) internal successors, (84), 26 states have internal predecessors, (84), 18 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2023-04-03 01:17:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2023-04-03 01:17:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2023-04-03 01:17:11,184 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:11,185 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 48, 48, 41, 38, 28, 28, 28, 28, 28, 28, 28, 24, 24, 24, 24, 24, 24, 24, 19, 14, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:11,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-03 01:17:11,391 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:11,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1626729987, now seen corresponding path program 10 times [2023-04-03 01:17:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332404074] [2023-04-03 01:17:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15035 backedges. 447 proven. 1249 refuted. 0 times theorem prover too weak. 13339 trivial. 0 not checked. [2023-04-03 01:17:11,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332404074] [2023-04-03 01:17:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332404074] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522086472] [2023-04-03 01:17:11,886 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:17:11,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:11,887 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:11,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-03 01:17:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:12,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-03 01:17:12,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15035 backedges. 509 proven. 1613 refuted. 0 times theorem prover too weak. 12913 trivial. 0 not checked. [2023-04-03 01:17:12,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15035 backedges. 511 proven. 1641 refuted. 0 times theorem prover too weak. 12883 trivial. 0 not checked. [2023-04-03 01:17:14,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522086472] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [239036184] [2023-04-03 01:17:14,702 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:14,702 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:14,702 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:14,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:14,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2023-04-03 01:17:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995106284] [2023-04-03 01:17:14,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:14,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-03 01:17:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-03 01:17:14,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-04-03 01:17:14,705 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (31), 13 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-03 01:17:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:14,937 INFO L93 Difference]: Finished difference Result 266 states and 426 transitions. [2023-04-03 01:17:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-03 01:17:14,941 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (31), 13 states have call predecessors, (31), 18 states have call successors, (31) Word has length 716 [2023-04-03 01:17:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:14,943 INFO L225 Difference]: With dead ends: 266 [2023-04-03 01:17:14,943 INFO L226 Difference]: Without dead ends: 236 [2023-04-03 01:17:14,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1416 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2023-04-03 01:17:14,945 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:14,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 282 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:17:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-04-03 01:17:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2023-04-03 01:17:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 152 states have internal predecessors, (182), 48 states have call successors, (48), 29 states have call predecessors, (48), 29 states have return successors, (142), 54 states have call predecessors, (142), 47 states have call successors, (142) [2023-04-03 01:17:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 372 transitions. [2023-04-03 01:17:14,966 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 372 transitions. Word has length 716 [2023-04-03 01:17:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:14,966 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 372 transitions. [2023-04-03 01:17:14,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 25 states have internal predecessors, (81), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (31), 13 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-03 01:17:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 372 transitions. [2023-04-03 01:17:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2023-04-03 01:17:14,971 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:14,971 INFO L195 NwaCegarLoop]: trace histogram [49, 49, 44, 44, 37, 34, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 15, 13, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:14,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:15,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:15,181 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:15,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1321412061, now seen corresponding path program 11 times [2023-04-03 01:17:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126155045] [2023-04-03 01:17:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11743 backedges. 565 proven. 929 refuted. 0 times theorem prover too weak. 10249 trivial. 0 not checked. [2023-04-03 01:17:15,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126155045] [2023-04-03 01:17:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126155045] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422843302] [2023-04-03 01:17:15,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:17:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:15,653 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:15,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-03 01:17:15,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-04-03 01:17:15,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:15,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:17:15,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11743 backedges. 3504 proven. 6 refuted. 0 times theorem prover too weak. 8233 trivial. 0 not checked. [2023-04-03 01:17:15,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11743 backedges. 1245 proven. 109 refuted. 0 times theorem prover too weak. 10389 trivial. 0 not checked. [2023-04-03 01:17:17,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422843302] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:17,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [87680091] [2023-04-03 01:17:17,133 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:17,133 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:17,133 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:17,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:17,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 22 [2023-04-03 01:17:17,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911097243] [2023-04-03 01:17:17,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:17,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-03 01:17:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-03 01:17:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-04-03 01:17:17,136 INFO L87 Difference]: Start difference. First operand 236 states and 372 transitions. Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 13 states have call predecessors, (34), 12 states have call successors, (34) [2023-04-03 01:17:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:17,434 INFO L93 Difference]: Finished difference Result 451 states and 764 transitions. [2023-04-03 01:17:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-03 01:17:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 13 states have call predecessors, (34), 12 states have call successors, (34) Word has length 636 [2023-04-03 01:17:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:17,437 INFO L225 Difference]: With dead ends: 451 [2023-04-03 01:17:17,437 INFO L226 Difference]: Without dead ends: 201 [2023-04-03 01:17:17,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1298 GetRequests, 1264 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2023-04-03 01:17:17,439 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:17,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:17:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-04-03 01:17:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2023-04-03 01:17:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 131 states have (on average 1.1145038167938932) internal successors, (146), 126 states have internal predecessors, (146), 38 states have call successors, (38), 27 states have call predecessors, (38), 22 states have return successors, (86), 38 states have call predecessors, (86), 37 states have call successors, (86) [2023-04-03 01:17:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2023-04-03 01:17:17,456 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 636 [2023-04-03 01:17:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:17,457 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2023-04-03 01:17:17,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 12 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (34), 13 states have call predecessors, (34), 12 states have call successors, (34) [2023-04-03 01:17:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2023-04-03 01:17:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2023-04-03 01:17:17,459 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:17,460 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 33, 33, 29, 28, 20, 20, 20, 20, 20, 20, 20, 16, 16, 16, 16, 16, 16, 16, 13, 11, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:17,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-04-03 01:17:17,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-03 01:17:17,665 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:17,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash 518885255, now seen corresponding path program 12 times [2023-04-03 01:17:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026713736] [2023-04-03 01:17:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7256 backedges. 783 proven. 367 refuted. 0 times theorem prover too weak. 6106 trivial. 0 not checked. [2023-04-03 01:17:18,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026713736] [2023-04-03 01:17:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026713736] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083264673] [2023-04-03 01:17:18,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:17:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:18,007 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:18,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-04-03 01:17:18,237 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:17:18,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:18,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:17:18,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7256 backedges. 426 proven. 670 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2023-04-03 01:17:18,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7256 backedges. 428 proven. 684 refuted. 0 times theorem prover too weak. 6144 trivial. 0 not checked. [2023-04-03 01:17:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083264673] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173557299] [2023-04-03 01:17:19,698 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:19,699 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:19,699 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:19,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:19,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 29 [2023-04-03 01:17:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147019726] [2023-04-03 01:17:19,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:19,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-03 01:17:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:19,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-03 01:17:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2023-04-03 01:17:19,704 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (34), 17 states have call predecessors, (34), 20 states have call successors, (34) [2023-04-03 01:17:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:20,314 INFO L93 Difference]: Finished difference Result 447 states and 719 transitions. [2023-04-03 01:17:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-03 01:17:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (34), 17 states have call predecessors, (34), 20 states have call successors, (34) Word has length 502 [2023-04-03 01:17:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:20,317 INFO L225 Difference]: With dead ends: 447 [2023-04-03 01:17:20,317 INFO L226 Difference]: Without dead ends: 237 [2023-04-03 01:17:20,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1047 GetRequests, 986 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=2647, Unknown=0, NotChecked=0, Total=3080 [2023-04-03 01:17:20,320 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 156 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:20,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 380 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:17:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-04-03 01:17:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 193. [2023-04-03 01:17:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.1136363636363635) internal successors, (147), 127 states have internal predecessors, (147), 38 states have call successors, (38), 27 states have call predecessors, (38), 22 states have return successors, (64), 38 states have call predecessors, (64), 37 states have call successors, (64) [2023-04-03 01:17:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 249 transitions. [2023-04-03 01:17:20,365 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 249 transitions. Word has length 502 [2023-04-03 01:17:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:20,365 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 249 transitions. [2023-04-03 01:17:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (29), 1 states have call predecessors, (29), 13 states have return successors, (34), 17 states have call predecessors, (34), 20 states have call successors, (34) [2023-04-03 01:17:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 249 transitions. [2023-04-03 01:17:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2023-04-03 01:17:20,367 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:20,367 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 31, 31, 26, 26, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 15, 15, 15, 15, 11, 9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:20,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:20,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-04-03 01:17:20,574 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:20,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 862423523, now seen corresponding path program 13 times [2023-04-03 01:17:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086177369] [2023-04-03 01:17:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 569 proven. 230 refuted. 0 times theorem prover too weak. 4919 trivial. 0 not checked. [2023-04-03 01:17:20,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086177369] [2023-04-03 01:17:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086177369] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069989507] [2023-04-03 01:17:20,879 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:17:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:20,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:20,880 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-04-03 01:17:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:21,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-03 01:17:21,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 677 proven. 288 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2023-04-03 01:17:21,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5718 backedges. 681 proven. 300 refuted. 0 times theorem prover too weak. 4737 trivial. 0 not checked. [2023-04-03 01:17:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069989507] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:22,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206370556] [2023-04-03 01:17:22,410 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:22,410 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:22,411 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:22,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 18 [2023-04-03 01:17:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736091596] [2023-04-03 01:17:22,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:22,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-03 01:17:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:22,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-03 01:17:22,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-04-03 01:17:22,412 INFO L87 Difference]: Start difference. First operand 193 states and 249 transitions. Second operand has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) [2023-04-03 01:17:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:22,582 INFO L93 Difference]: Finished difference Result 203 states and 258 transitions. [2023-04-03 01:17:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-03 01:17:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) Word has length 449 [2023-04-03 01:17:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:22,584 INFO L225 Difference]: With dead ends: 203 [2023-04-03 01:17:22,584 INFO L226 Difference]: Without dead ends: 186 [2023-04-03 01:17:22,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 887 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2023-04-03 01:17:22,585 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:22,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:17:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-04-03 01:17:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2023-04-03 01:17:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.12) internal successors, (140), 120 states have internal predecessors, (140), 35 states have call successors, (35), 27 states have call predecessors, (35), 20 states have return successors, (51), 33 states have call predecessors, (51), 34 states have call successors, (51) [2023-04-03 01:17:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2023-04-03 01:17:22,601 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 449 [2023-04-03 01:17:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:22,602 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2023-04-03 01:17:22,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 18 states have internal predecessors, (66), 13 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 10 states have call predecessors, (24), 13 states have call successors, (24) [2023-04-03 01:17:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2023-04-03 01:17:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2023-04-03 01:17:22,604 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:22,604 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 33, 28, 27, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 12, 9, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:22,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:22,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:22,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:22,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2007637741, now seen corresponding path program 14 times [2023-04-03 01:17:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519669385] [2023-04-03 01:17:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 772 proven. 142 refuted. 0 times theorem prover too weak. 5539 trivial. 0 not checked. [2023-04-03 01:17:23,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519669385] [2023-04-03 01:17:23,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519669385] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132648809] [2023-04-03 01:17:23,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:17:23,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:23,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:23,127 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:23,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-04-03 01:17:23,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-03 01:17:23,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:23,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:17:23,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 1420 proven. 21 refuted. 0 times theorem prover too weak. 5012 trivial. 0 not checked. [2023-04-03 01:17:23,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6453 backedges. 944 proven. 48 refuted. 0 times theorem prover too weak. 5461 trivial. 0 not checked. [2023-04-03 01:17:24,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132648809] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:24,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1811653475] [2023-04-03 01:17:24,404 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:24,404 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:24,404 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:24,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2023-04-03 01:17:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005795962] [2023-04-03 01:17:24,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:24,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-03 01:17:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-03 01:17:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-04-03 01:17:24,406 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 23 states have internal predecessors, (84), 13 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (31), 12 states have call predecessors, (31), 13 states have call successors, (31) [2023-04-03 01:17:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:24,811 INFO L93 Difference]: Finished difference Result 285 states and 351 transitions. [2023-04-03 01:17:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-03 01:17:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 23 states have internal predecessors, (84), 13 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (31), 12 states have call predecessors, (31), 13 states have call successors, (31) Word has length 476 [2023-04-03 01:17:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:24,813 INFO L225 Difference]: With dead ends: 285 [2023-04-03 01:17:24,813 INFO L226 Difference]: Without dead ends: 179 [2023-04-03 01:17:24,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 940 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=1242, Unknown=0, NotChecked=0, Total=1482 [2023-04-03 01:17:24,814 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 73 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 292 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:17:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-04-03 01:17:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2023-04-03 01:17:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 120 states have (on average 1.125) internal successors, (135), 114 states have internal predecessors, (135), 33 states have call successors, (33), 28 states have call predecessors, (33), 17 states have return successors, (40), 28 states have call predecessors, (40), 32 states have call successors, (40) [2023-04-03 01:17:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 208 transitions. [2023-04-03 01:17:24,829 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 208 transitions. Word has length 476 [2023-04-03 01:17:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:24,829 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 208 transitions. [2023-04-03 01:17:24,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 23 states have internal predecessors, (84), 13 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (31), 12 states have call predecessors, (31), 13 states have call successors, (31) [2023-04-03 01:17:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 208 transitions. [2023-04-03 01:17:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-04-03 01:17:24,832 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:24,832 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:24,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-04-03 01:17:25,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:25,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:25,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash -770710392, now seen corresponding path program 15 times [2023-04-03 01:17:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:25,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154756445] [2023-04-03 01:17:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2023-04-03 01:17:28,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154756445] [2023-04-03 01:17:28,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154756445] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583155990] [2023-04-03 01:17:28,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:17:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:28,731 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:17:28,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-04-03 01:17:28,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:17:28,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:28,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 271 conjunts are in the unsatisfiable core [2023-04-03 01:17:29,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2023-04-03 01:17:30,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6082 backedges. 0 proven. 2033 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2023-04-03 01:17:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583155990] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319821207] [2023-04-03 01:17:32,856 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-03 01:17:32,856 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:32,856 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:17:32,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2023-04-03 01:17:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195090354] [2023-04-03 01:17:32,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:32,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-04-03 01:17:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-04-03 01:17:32,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2023-04-03 01:17:32,858 INFO L87 Difference]: Start difference. First operand 171 states and 208 transitions. Second operand has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 11 states have call successors, (36) [2023-04-03 01:17:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:33,391 INFO L93 Difference]: Finished difference Result 171 states and 208 transitions. [2023-04-03 01:17:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-03 01:17:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 11 states have call successors, (36) Word has length 463 [2023-04-03 01:17:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:33,392 INFO L225 Difference]: With dead ends: 171 [2023-04-03 01:17:33,392 INFO L226 Difference]: Without dead ends: 0 [2023-04-03 01:17:33,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 902 SyntacticMatches, 110 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=2527, Unknown=0, NotChecked=0, Total=2652 [2023-04-03 01:17:33,394 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:33,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2368 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-03 01:17:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-03 01:17:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-03 01:17:33,394 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-03 01:17:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-03 01:17:33,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 463 [2023-04-03 01:17:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:33,395 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-03 01:17:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 11 states have call successors, (36) [2023-04-03 01:17:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-03 01:17:33,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-03 01:17:33,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-03 01:17:33,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-04-03 01:17:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:33,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-03 01:18:19,579 WARN L223 SmtUtils]: Spent 20.42s on a formula simplification. DAG size of input: 124 DAG size of output: 68 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:18:31,319 WARN L223 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 105 DAG size of output: 73 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:18:54,267 WARN L223 SmtUtils]: Spent 18.52s on a formula simplification. DAG size of input: 121 DAG size of output: 58 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:19:11,976 WARN L223 SmtUtils]: Spent 17.71s on a formula simplification. DAG size of input: 117 DAG size of output: 60 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:19:55,460 WARN L223 SmtUtils]: Spent 43.46s on a formula simplification. DAG size of input: 155 DAG size of output: 111 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:20:30,054 WARN L223 SmtUtils]: Spent 29.93s on a formula simplification. DAG size of input: 125 DAG size of output: 58 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:20:49,875 WARN L223 SmtUtils]: Spent 19.78s on a formula simplification. DAG size of input: 129 DAG size of output: 84 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-04-03 01:21:04,648 WARN L223 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 105 DAG size of output: 73 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)