/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/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:17:33,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:17:33,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:17:33,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:17:33,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:17:33,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:17:33,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:17:33,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:17:33,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:17:33,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:17:33,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:17:33,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:17:33,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:17:33,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:17:33,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:17:33,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:17:33,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:17:34,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:17:34,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:17:34,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:17:34,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:17:34,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:17:34,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:17:34,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:17:34,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:17:34,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:17:34,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:17:34,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:17:34,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:17:34,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:17:34,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:17:34,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:17:34,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:17:34,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:17:34,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:17:34,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:17:34,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:17:34,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:17:34,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:17:34,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:17:34,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:17:34,021 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:17:34,045 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:17:34,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:17:34,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:17:34,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:17:34,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:17:34,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:17:34,047 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:17:34,047 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:17:34,047 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:17:34,047 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:17:34,048 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:17:34,048 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:17:34,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:17:34,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:17:34,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:17:34,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:17:34,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:17:34,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:17:34,051 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:17:34,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:17:34,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:17:34,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:17:34,051 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:17:34,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:17:34,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:17:34,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:17:34,269 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:17:34,269 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:17:34,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2023-04-03 01:17:35,309 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:17:35,490 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:17:35,490 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2023-04-03 01:17:35,493 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237014e29/bdae17ba1a1647d7ae5bae1e0f70d11e/FLAG17c860d1a [2023-04-03 01:17:35,502 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237014e29/bdae17ba1a1647d7ae5bae1e0f70d11e [2023-04-03 01:17:35,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:17:35,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:17:35,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:17:35,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:17:35,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:17:35,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f589721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35, skipping insertion in model container [2023-04-03 01:17:35,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:17:35,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:17:35,612 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/id2_i5_o5-2.c[548,561] [2023-04-03 01:17:35,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:17:35,623 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:17:35,633 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/id2_i5_o5-2.c[548,561] [2023-04-03 01:17:35,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:17:35,642 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:17:35,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35 WrapperNode [2023-04-03 01:17:35,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:17:35,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:17:35,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:17:35,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:17:35,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:17:35,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:17:35,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:17:35,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:17:35,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (1/1) ... [2023-04-03 01:17:35,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:17:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:35,719 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:17:35,738 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:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-04-03 01:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2023-04-03 01:17:35,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:17:35,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:17:35,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:17:35,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:17:35,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:17:35,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:17:35,808 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:17:35,810 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:17:35,926 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:17:35,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:17:35,935 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-03 01:17:35,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:17:35 BoogieIcfgContainer [2023-04-03 01:17:35,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:17:35,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:17:35,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:17:35,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:17:35,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:17:35" (1/3) ... [2023-04-03 01:17:35,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1bd3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:17:35, skipping insertion in model container [2023-04-03 01:17:35,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:17:35" (2/3) ... [2023-04-03 01:17:35,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1bd3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:17:35, skipping insertion in model container [2023-04-03 01:17:35,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:17:35" (3/3) ... [2023-04-03 01:17:35,942 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2023-04-03 01:17:35,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:17:35,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:17:36,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:17:36,022 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;@483c742c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:17:36,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:17:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-03 01:17:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-03 01:17:36,030 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:36,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:36,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:36,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1088902710, now seen corresponding path program 1 times [2023-04-03 01:17:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:36,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077021262] [2023-04-03 01:17:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:36,328 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:17:36,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077021262] [2023-04-03 01:17:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077021262] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:17:36,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:17:36,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:17:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018493396] [2023-04-03 01:17:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:17:36,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:17:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:17:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:17:36,397 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-03 01:17:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:36,491 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-04-03 01:17:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:17:36,493 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:17:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:36,498 INFO L225 Difference]: With dead ends: 36 [2023-04-03 01:17:36,498 INFO L226 Difference]: Without dead ends: 24 [2023-04-03 01:17:36,500 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:17:36,502 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:36,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 72 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:17:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-03 01:17:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-03 01:17:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-03 01:17:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-04-03 01:17:36,525 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2023-04-03 01:17:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:36,525 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-04-03 01:17:36,525 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:17:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-04-03 01:17:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-03 01:17:36,526 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:36,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:36,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:17:36,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:36,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1018989271, now seen corresponding path program 1 times [2023-04-03 01:17:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865026811] [2023-04-03 01:17:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:36,604 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:17:36,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865026811] [2023-04-03 01:17:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865026811] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:17:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:17:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-03 01:17:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613382599] [2023-04-03 01:17:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:17:36,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-03 01:17:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:36,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-03 01:17:36,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-03 01:17:36,607 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-03 01:17:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:36,659 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2023-04-03 01:17:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-03 01:17:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-03 01:17:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:36,662 INFO L225 Difference]: With dead ends: 33 [2023-04-03 01:17:36,663 INFO L226 Difference]: Without dead ends: 29 [2023-04-03 01:17:36,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:17:36,668 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:36,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-03 01:17:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-04-03 01:17:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-03 01:17:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-04-03 01:17:36,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2023-04-03 01:17:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:36,685 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-04-03 01:17:36,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-03 01:17:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-04-03 01:17:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-03 01:17:36,686 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:36,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:36,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-03 01:17:36,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:36,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1959056254, now seen corresponding path program 1 times [2023-04-03 01:17:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329696211] [2023-04-03 01:17:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-03 01:17:36,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329696211] [2023-04-03 01:17:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329696211] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979983594] [2023-04-03 01:17:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:36,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:36,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:36,870 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:17:36,906 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:17:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:36,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:17:36,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-03 01:17:36,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:37,210 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:17:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979983594] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546456407] [2023-04-03 01:17:37,223 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:17:37,223 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:37,225 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:37,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2023-04-03 01:17:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904067724] [2023-04-03 01:17:37,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:37,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-03 01:17:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-03 01:17:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-04-03 01:17:37,228 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-03 01:17:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:37,283 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-04-03 01:17:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-03 01:17:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) Word has length 25 [2023-04-03 01:17:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:37,284 INFO L225 Difference]: With dead ends: 39 [2023-04-03 01:17:37,285 INFO L226 Difference]: Without dead ends: 35 [2023-04-03 01:17:37,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:17:37,285 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:37,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-03 01:17:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-04-03 01:17:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-03 01:17:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-04-03 01:17:37,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2023-04-03 01:17:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-04-03 01:17:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 12 states have internal predecessors, (22), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-03 01:17:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-04-03 01:17:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-03 01:17:37,290 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:37,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:37,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-03 01:17:37,495 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:17:37,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:37,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 142733283, now seen corresponding path program 1 times [2023-04-03 01:17:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203009067] [2023-04-03 01:17:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-03 01:17:37,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203009067] [2023-04-03 01:17:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203009067] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:37,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35173262] [2023-04-03 01:17:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:37,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:37,577 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:17:37,579 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:17:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:37,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-03 01:17:37,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-03 01:17:37,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-03 01:17:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35173262] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843685683] [2023-04-03 01:17:38,008 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:17:38,008 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:38,009 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:38,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 14 [2023-04-03 01:17:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977936199] [2023-04-03 01:17:38,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:38,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-03 01:17:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:38,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-03 01:17:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:17:38,010 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-03 01:17:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:38,086 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-04-03 01:17:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:17:38,087 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 31 [2023-04-03 01:17:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:38,087 INFO L225 Difference]: With dead ends: 45 [2023-04-03 01:17:38,087 INFO L226 Difference]: Without dead ends: 41 [2023-04-03 01:17:38,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-04-03 01:17:38,088 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:38,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-03 01:17:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2023-04-03 01:17:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-03 01:17:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-04-03 01:17:38,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2023-04-03 01:17:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:38,092 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-04-03 01:17:38,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-03 01:17:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-04-03 01:17:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-03 01:17:38,093 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:38,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:38,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-03 01:17:38,298 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:17:38,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:38,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash -89911090, now seen corresponding path program 2 times [2023-04-03 01:17:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504204431] [2023-04-03 01:17:38,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-03 01:17:38,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504204431] [2023-04-03 01:17:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504204431] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942545059] [2023-04-03 01:17:38,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:17:38,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:38,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:38,413 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:17:38,414 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:17:38,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-03 01:17:38,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:38,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-03 01:17:38,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-03 01:17:38,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:17:39,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942545059] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1338291552] [2023-04-03 01:17:39,045 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:17:39,045 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:39,045 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:39,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2023-04-03 01:17:39,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307609083] [2023-04-03 01:17:39,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:39,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-03 01:17:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-03 01:17:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:17:39,048 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2023-04-03 01:17:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:39,120 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-04-03 01:17:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-03 01:17:39,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) Word has length 37 [2023-04-03 01:17:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:39,123 INFO L225 Difference]: With dead ends: 51 [2023-04-03 01:17:39,123 INFO L226 Difference]: Without dead ends: 47 [2023-04-03 01:17:39,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:17:39,124 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:39,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-03 01:17:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2023-04-03 01:17:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-03 01:17:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-04-03 01:17:39,137 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2023-04-03 01:17:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:39,137 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-04-03 01:17:39,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2023-04-03 01:17:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-04-03 01:17:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-03 01:17:39,141 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:39,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:39,148 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:17:39,346 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:17:39,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:39,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1022291217, now seen corresponding path program 2 times [2023-04-03 01:17:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457988138] [2023-04-03 01:17:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-03 01:17:39,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457988138] [2023-04-03 01:17:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457988138] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:17:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93768427] [2023-04-03 01:17:39,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:17:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:17:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:17:39,582 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:17:39,607 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:17:39,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-03 01:17:39,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:17:39,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 27 conjunts are in the unsatisfiable core [2023-04-03 01:17:39,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:17:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-03 01:17:39,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:17:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-03 01:17:39,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93768427] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:17:39,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1638370396] [2023-04-03 01:17:39,889 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-03 01:17:39,889 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:17:39,890 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:39,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:17:39,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2023-04-03 01:17:39,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480266584] [2023-04-03 01:17:39,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:17:39,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-03 01:17:39,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-03 01:17:39,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:17:39,891 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2023-04-03 01:17:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:39,955 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2023-04-03 01:17:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-03 01:17:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2023-04-03 01:17:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:39,959 INFO L225 Difference]: With dead ends: 57 [2023-04-03 01:17:39,959 INFO L226 Difference]: Without dead ends: 53 [2023-04-03 01:17:39,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:17:39,960 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:39,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:17:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-03 01:17:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-04-03 01:17:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-03 01:17:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-04-03 01:17:39,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2023-04-03 01:17:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:39,969 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-04-03 01:17:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2023-04-03 01:17:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-04-03 01:17:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-03 01:17:39,976 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:39,977 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:39,991 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:17:40,182 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:17:40,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:40,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 426050330, now seen corresponding path program 3 times [2023-04-03 01:17:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853465434] [2023-04-03 01:17:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:40,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-03 01:17:40,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853465434] [2023-04-03 01:17:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853465434] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:17:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:17:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-03 01:17:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262273521] [2023-04-03 01:17:40,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:17:40,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-03 01:17:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-03 01:17:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-04-03 01:17:40,327 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-03 01:17:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:40,409 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-04-03 01:17:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-03 01:17:40,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2023-04-03 01:17:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:40,410 INFO L225 Difference]: With dead ends: 63 [2023-04-03 01:17:40,410 INFO L226 Difference]: Without dead ends: 39 [2023-04-03 01:17:40,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:17:40,411 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:40,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-03 01:17:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-04-03 01:17:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-03 01:17:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-04-03 01:17:40,414 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2023-04-03 01:17:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:40,414 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-04-03 01:17:40,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-03 01:17:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-04-03 01:17:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-03 01:17:40,415 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:17:40,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:17:40,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-03 01:17:40,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:17:40,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:17:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1581839355, now seen corresponding path program 3 times [2023-04-03 01:17:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:17:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877057982] [2023-04-03 01:17:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:17:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:17:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:17:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-03 01:17:40,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:17:40,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877057982] [2023-04-03 01:17:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877057982] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:17:40,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:17:40,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-03 01:17:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932802653] [2023-04-03 01:17:40,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:17:40,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-03 01:17:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:17:40,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-03 01:17:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:17:40,596 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-03 01:17:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:17:40,702 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2023-04-03 01:17:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-03 01:17:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 55 [2023-04-03 01:17:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:17:40,703 INFO L225 Difference]: With dead ends: 39 [2023-04-03 01:17:40,703 INFO L226 Difference]: Without dead ends: 0 [2023-04-03 01:17:40,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-04-03 01:17:40,704 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:17:40,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:17:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-03 01:17:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-03 01:17:40,705 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:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-03 01:17:40,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-04-03 01:17:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:17:40,705 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-03 01:17:40,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2023-04-03 01:17:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-03 01:17:40,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-03 01:17:40,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-03 01:17:40,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-03 01:17:40,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-03 01:17:40,734 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2023-04-03 01:17:40,734 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 4) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 25) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 24) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L895 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (<= 5 main_~input~0) (<= main_~input~0 5)) [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 19 25) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 19 25) the Hoare annotation is: true [2023-04-03 01:17:40,735 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (and (<= id2_~x |id2_#in~x|) (<= |id2_#in~x| id2_~x)) [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2023-04-03 01:17:40,735 INFO L899 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 17) the Hoare annotation is: true [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point id2EXIT(lines 14 17) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point id2FINAL(lines 14 17) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point idFINAL(lines 9 12) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L895 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (and (<= id_~x |id_#in~x|) (<= |id_#in~x| id_~x)) [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point idEXIT(lines 9 12) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2023-04-03 01:17:40,736 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 12) the Hoare annotation is: true [2023-04-03 01:17:40,738 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2023-04-03 01:17:40,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-03 01:17:40,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.04 01:17:40 BoogieIcfgContainer [2023-04-03 01:17:40,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-03 01:17:40,742 INFO L158 Benchmark]: Toolchain (without parser) took 5236.58ms. Allocated memory is still 294.6MB. Free memory was 259.5MB in the beginning and 221.8MB in the end (delta: 37.7MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2023-04-03 01:17:40,742 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-03 01:17:40,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.96ms. Allocated memory is still 294.6MB. Free memory was 259.5MB in the beginning and 249.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-03 01:17:40,742 INFO L158 Benchmark]: Boogie Preprocessor took 24.75ms. Allocated memory is still 294.6MB. Free memory was 249.5MB in the beginning and 248.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-03 01:17:40,742 INFO L158 Benchmark]: RCFGBuilder took 268.35ms. Allocated memory is still 294.6MB. Free memory was 248.0MB in the beginning and 237.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-03 01:17:40,742 INFO L158 Benchmark]: TraceAbstraction took 4803.04ms. Allocated memory is still 294.6MB. Free memory was 236.5MB in the beginning and 221.8MB in the end (delta: 14.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2023-04-03 01:17:40,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 136.96ms. Allocated memory is still 294.6MB. Free memory was 259.5MB in the beginning and 249.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.75ms. Allocated memory is still 294.6MB. Free memory was 249.5MB in the beginning and 248.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 268.35ms. Allocated memory is still 294.6MB. Free memory was 248.0MB in the beginning and 237.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4803.04ms. Allocated memory is still 294.6MB. Free memory was 236.5MB in the beginning and 221.8MB in the end (delta: 14.7MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 918 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 171 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 27 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 1432 SizeOfPredicates, 13 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 203/312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-03 01:17:40,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...