/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/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 21:50:57,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 21:50:57,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 21:50:57,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 21:50:57,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 21:50:57,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 21:50:57,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 21:50:57,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 21:50:58,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 21:50:58,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 21:50:58,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 21:50:58,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 21:50:58,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 21:50:58,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 21:50:58,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 21:50:58,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 21:50:58,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 21:50:58,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 21:50:58,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 21:50:58,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 21:50:58,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 21:50:58,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 21:50:58,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 21:50:58,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 21:50:58,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 21:50:58,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 21:50:58,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 21:50:58,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 21:50:58,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 21:50:58,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 21:50:58,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 21:50:58,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 21:50:58,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 21:50:58,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 21:50:58,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 21:50:58,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 21:50:58,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 21:50:58,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 21:50:58,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 21:50:58,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 21:50:58,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 21:50:58,036 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-02 21:50:58,060 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 21:50:58,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 21:50:58,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 21:50:58,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 21:50:58,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 21:50:58,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 21:50:58,062 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 21:50:58,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 21:50:58,062 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 21:50:58,062 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 21:50:58,062 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 21:50:58,063 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 21:50:58,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 21:50:58,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 21:50:58,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 21:50:58,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:50:58,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 21:50:58,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 21:50:58,065 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-02 21:50:58,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 21:50:58,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 21:50:58,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 21:50:58,256 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 21:50:58,256 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 21:50:58,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-04-02 21:50:59,299 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 21:50:59,520 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 21:50:59,521 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2023-04-02 21:50:59,530 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d729f293b/f1c02b85ca3e4d87a678d5cf30f373c1/FLAG323a566b2 [2023-04-02 21:50:59,543 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d729f293b/f1c02b85ca3e4d87a678d5cf30f373c1 [2023-04-02 21:50:59,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 21:50:59,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 21:50:59,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 21:50:59,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 21:50:59,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 21:50:59,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f1491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59, skipping insertion in model container [2023-04-02 21:50:59,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 21:50:59,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 21:50:59,765 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-04-02 21:50:59,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:50:59,774 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 21:50:59,807 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/list-simple/sll2n_update_all_reverse.i[24236,24249] [2023-04-02 21:50:59,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:50:59,839 INFO L208 MainTranslator]: Completed translation [2023-04-02 21:50:59,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59 WrapperNode [2023-04-02 21:50:59,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 21:50:59,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 21:50:59,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 21:50:59,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 21:50:59,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,889 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 21:50:59,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 21:50:59,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 21:50:59,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 21:50:59,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (1/1) ... [2023-04-02 21:50:59,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:50:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:50:59,936 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-02 21:50:59,942 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-02 21:50:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 21:50:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 21:50:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 21:50:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 21:50:59,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 21:50:59,971 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 21:50:59,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 21:50:59,972 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2023-04-02 21:50:59,972 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2023-04-02 21:50:59,972 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2023-04-02 21:50:59,972 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2023-04-02 21:50:59,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 21:50:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 21:50:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 21:50:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 21:50:59,973 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 21:50:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 21:50:59,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 21:50:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 21:50:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 21:50:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 21:50:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 21:50:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 21:50:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 21:50:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 21:50:59,977 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 21:50:59,978 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 21:50:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 21:50:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 21:50:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 21:50:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 21:50:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 21:50:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 21:50:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 21:50:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 21:50:59,983 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 21:50:59,984 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 21:50:59,985 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 21:50:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 21:50:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 21:50:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 21:50:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 21:50:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 21:50:59,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 21:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 21:51:00,187 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 21:51:00,189 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 21:51:00,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 21:51:00,404 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 21:51:00,457 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 21:51:00,457 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-02 21:51:00,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:51:00 BoogieIcfgContainer [2023-04-02 21:51:00,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 21:51:00,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 21:51:00,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 21:51:00,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 21:51:00,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 09:50:59" (1/3) ... [2023-04-02 21:51:00,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510a917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:51:00, skipping insertion in model container [2023-04-02 21:51:00,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:59" (2/3) ... [2023-04-02 21:51:00,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2510a917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:51:00, skipping insertion in model container [2023-04-02 21:51:00,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:51:00" (3/3) ... [2023-04-02 21:51:00,471 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2023-04-02 21:51:00,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 21:51:00,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 21:51:00,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 21:51:00,526 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;@1ccfa6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 21:51:00,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 21:51:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 21:51:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-02 21:51:00,535 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:00,536 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-02 21:51:00,536 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:00,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1896556068, now seen corresponding path program 1 times [2023-04-02 21:51:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509586699] [2023-04-02 21:51:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:00,737 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-02 21:51:00,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509586699] [2023-04-02 21:51:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509586699] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:51:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 21:51:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 21:51:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654641203] [2023-04-02 21:51:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:00,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 21:51:00,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 21:51:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 21:51:00,766 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 21:51:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:00,872 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2023-04-02 21:51:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 21:51:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2023-04-02 21:51:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:00,878 INFO L225 Difference]: With dead ends: 72 [2023-04-02 21:51:00,879 INFO L226 Difference]: Without dead ends: 34 [2023-04-02 21:51:00,881 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-02 21:51:00,883 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:00,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 123 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 21:51:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-02 21:51:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-04-02 21:51:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-02 21:51:00,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2023-04-02 21:51:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:00,979 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-02 21:51:00,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 21:51:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-02 21:51:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-02 21:51:00,980 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:00,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:00,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 21:51:00,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:00,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1342820788, now seen corresponding path program 1 times [2023-04-02 21:51:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:00,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889248894] [2023-04-02 21:51:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:51:01,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889248894] [2023-04-02 21:51:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889248894] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502795371] [2023-04-02 21:51:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:01,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:01,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:01,137 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-02 21:51:01,165 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-02 21:51:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:01,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:51:01,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:51:01,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:51:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502795371] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2106469007] [2023-04-02 21:51:01,411 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-04-02 21:51:01,411 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:01,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:01,418 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:01,418 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:01,471 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:01,762 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:02,102 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:02,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:02,119 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2106469007] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:51:02,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:02,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [6, 6, 6] total 27 [2023-04-02 21:51:02,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217424996] [2023-04-02 21:51:02,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:02,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-02 21:51:02,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:02,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-02 21:51:02,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-04-02 21:51:02,633 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:51:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:03,975 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-04-02 21:51:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-02 21:51:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-02 21:51:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:03,977 INFO L225 Difference]: With dead ends: 47 [2023-04-02 21:51:03,978 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 21:51:03,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=1630, Unknown=0, NotChecked=0, Total=1892 [2023-04-02 21:51:03,979 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 71 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:03,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 21:51:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 21:51:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-04-02 21:51:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-04-02 21:51:03,986 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2023-04-02 21:51:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:03,987 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-04-02 21:51:03,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:51:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-04-02 21:51:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 21:51:03,987 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:03,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:03,993 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-02 21:51:04,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:04,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:04,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash -473825393, now seen corresponding path program 1 times [2023-04-02 21:51:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:04,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382125689] [2023-04-02 21:51:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:51:04,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382125689] [2023-04-02 21:51:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382125689] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652665784] [2023-04-02 21:51:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:04,356 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-02 21:51:04,358 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-02 21:51:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:04,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:51:04,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:51:04,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:51:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652665784] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:04,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923843969] [2023-04-02 21:51:04,620 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:04,620 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:04,620 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:04,620 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:04,620 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:04,632 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:04,750 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:04,926 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:04,934 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 25 for LOIs [2023-04-02 21:51:04,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:04,939 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:05,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1923843969] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:51:05,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:05,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 6, 6] total 30 [2023-04-02 21:51:05,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506491531] [2023-04-02 21:51:05,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:05,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-02 21:51:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-02 21:51:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2023-04-02 21:51:05,557 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 20 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:07,182 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-04-02 21:51:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 21:51:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 32 [2023-04-02 21:51:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:07,183 INFO L225 Difference]: With dead ends: 54 [2023-04-02 21:51:07,183 INFO L226 Difference]: Without dead ends: 39 [2023-04-02 21:51:07,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 21:51:07,185 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:07,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 6 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 21:51:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-02 21:51:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-04-02 21:51:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:51:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-04-02 21:51:07,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2023-04-02 21:51:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:07,193 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-04-02 21:51:07,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-04-02 21:51:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-02 21:51:07,194 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:07,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:07,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-02 21:51:07,412 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:07,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1330689309, now seen corresponding path program 1 times [2023-04-02 21:51:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346003215] [2023-04-02 21:51:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 21:51:07,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346003215] [2023-04-02 21:51:07,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346003215] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:07,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783502348] [2023-04-02 21:51:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:07,519 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-02 21:51:07,521 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-02 21:51:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:07,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:51:07,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 21:51:07,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 21:51:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783502348] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030437103] [2023-04-02 21:51:07,731 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:07,731 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:07,731 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:07,732 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:07,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:07,742 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:07,974 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:07,977 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:08,160 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:08,170 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 30 for LOIs [2023-04-02 21:51:08,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:08,206 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:09,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2030437103] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:51:09,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:09,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [6, 6, 6] total 35 [2023-04-02 21:51:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484451745] [2023-04-02 21:51:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:09,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-02 21:51:09,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-02 21:51:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 21:51:09,103 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:10,674 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2023-04-02 21:51:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-02 21:51:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 33 [2023-04-02 21:51:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:10,676 INFO L225 Difference]: With dead ends: 58 [2023-04-02 21:51:10,676 INFO L226 Difference]: Without dead ends: 49 [2023-04-02 21:51:10,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=400, Invalid=3506, Unknown=0, NotChecked=0, Total=3906 [2023-04-02 21:51:10,677 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:10,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 15 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-02 21:51:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-02 21:51:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2023-04-02 21:51:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 21:51:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-04-02 21:51:10,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 33 [2023-04-02 21:51:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:10,710 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-04-02 21:51:10,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:51:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-04-02 21:51:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 21:51:10,711 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:10,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:10,719 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-02 21:51:10,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:10,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:10,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash -870267775, now seen corresponding path program 1 times [2023-04-02 21:51:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70894507] [2023-04-02 21:51:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:51:10,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70894507] [2023-04-02 21:51:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70894507] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245385241] [2023-04-02 21:51:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:10,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:10,997 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-02 21:51:10,999 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-02 21:51:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:11,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:51:11,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:51:11,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:51:11,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245385241] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:11,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531502317] [2023-04-02 21:51:11,206 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:11,206 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:11,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:11,206 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:11,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:11,220 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:11,400 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:11,411 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:11,595 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:11,602 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 28 for LOIs [2023-04-02 21:51:11,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:11,638 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:12,501 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1626#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~len~0 2) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:12,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:12,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-04-02 21:51:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546288004] [2023-04-02 21:51:12,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:12,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 21:51:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 21:51:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2023-04-02 21:51:12,503 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 12 states, 8 states have (on average 4.75) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-02 21:51:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:12,583 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2023-04-02 21:51:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 21:51:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 4.75) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2023-04-02 21:51:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:12,584 INFO L225 Difference]: With dead ends: 74 [2023-04-02 21:51:12,584 INFO L226 Difference]: Without dead ends: 47 [2023-04-02 21:51:12,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2023-04-02 21:51:12,585 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:12,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 21:51:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-02 21:51:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-04-02 21:51:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 21:51:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-04-02 21:51:12,596 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 34 [2023-04-02 21:51:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:12,596 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-04-02 21:51:12,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 4.75) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-02 21:51:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-04-02 21:51:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 21:51:12,597 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:12,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:12,621 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-02 21:51:12,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:12,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:12,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash -174194159, now seen corresponding path program 2 times [2023-04-02 21:51:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484676198] [2023-04-02 21:51:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:12,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 21:51:12,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484676198] [2023-04-02 21:51:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484676198] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713772655] [2023-04-02 21:51:12,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 21:51:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:12,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:12,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 21:51:13,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 21:51:13,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:51:13,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 21:51:13,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 21:51:13,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 21:51:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713772655] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758582481] [2023-04-02 21:51:13,116 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:13,116 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:13,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:13,117 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:13,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:13,126 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:13,295 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:13,304 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:13,479 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:13,488 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 28 for LOIs [2023-04-02 21:51:13,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:13,541 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:14,404 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2103#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~len~0 2) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:14,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:14,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-04-02 21:51:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271517720] [2023-04-02 21:51:14,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:14,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 21:51:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 21:51:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2023-04-02 21:51:14,409 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 21:51:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:14,472 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-04-02 21:51:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 21:51:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2023-04-02 21:51:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:14,490 INFO L225 Difference]: With dead ends: 67 [2023-04-02 21:51:14,490 INFO L226 Difference]: Without dead ends: 52 [2023-04-02 21:51:14,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 21:51:14,505 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:14,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 21:51:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-02 21:51:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-04-02 21:51:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 21:51:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2023-04-02 21:51:14,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 41 [2023-04-02 21:51:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:14,516 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2023-04-02 21:51:14,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 21:51:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2023-04-02 21:51:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-02 21:51:14,517 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:14,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:14,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-02 21:51:14,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:14,722 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:14,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1360136722, now seen corresponding path program 3 times [2023-04-02 21:51:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:14,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18583106] [2023-04-02 21:51:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:51:16,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18583106] [2023-04-02 21:51:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18583106] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287045952] [2023-04-02 21:51:16,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 21:51:16,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:16,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:16,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:16,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 21:51:16,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 21:51:16,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:51:16,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 116 conjunts are in the unsatisfiable core [2023-04-02 21:51:16,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:16,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:51:16,829 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 21:51:16,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 21:51:16,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 21:51:16,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:51:17,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-04-02 21:51:17,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 21:51:17,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2023-04-02 21:51:17,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-04-02 21:51:17,294 WARN L861 $PredicateComparison]: unable to prove that (and (exists ((sll_update_at_~head.offset Int) (v_ArrVal_372 Int) (v_ArrVal_370 Int)) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset v_ArrVal_372)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset v_ArrVal_370)) |c_#memory_$Pointer$.base|) (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|))) (exists ((v_ArrVal_369 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| v_ArrVal_369)))) is different from true [2023-04-02 21:51:17,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:51:17,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-04-02 21:51:17,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:51:17,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2023-04-02 21:51:17,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-04-02 21:51:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-04-02 21:51:17,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287045952] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1880592155] [2023-04-02 21:51:18,240 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:18,241 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:18,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:18,241 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:18,241 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:18,254 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:18,405 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:18,414 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:18,571 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:18,578 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 30 for LOIs [2023-04-02 21:51:18,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:18,609 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:20,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2554#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~len~0 2) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:20,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:20,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:51:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 53 [2023-04-02 21:51:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711000594] [2023-04-02 21:51:20,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:20,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-04-02 21:51:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-04-02 21:51:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=6633, Unknown=23, NotChecked=164, Total=7140 [2023-04-02 21:51:20,414 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 53 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 43 states have internal predecessors, (54), 9 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-02 21:51:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:22,129 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2023-04-02 21:51:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 21:51:22,129 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 43 states have internal predecessors, (54), 9 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 47 [2023-04-02 21:51:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:22,130 INFO L225 Difference]: With dead ends: 97 [2023-04-02 21:51:22,130 INFO L226 Difference]: Without dead ends: 95 [2023-04-02 21:51:22,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=589, Invalid=11146, Unknown=41, NotChecked=214, Total=11990 [2023-04-02 21:51:22,133 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 142 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:22,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 348 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1491 Invalid, 0 Unknown, 99 Unchecked, 0.8s Time] [2023-04-02 21:51:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-04-02 21:51:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2023-04-02 21:51:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.25) internal successors, (55), 46 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2023-04-02 21:51:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2023-04-02 21:51:22,150 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 47 [2023-04-02 21:51:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:22,150 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2023-04-02 21:51:22,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 43 states have internal predecessors, (54), 9 states have call successors, (11), 5 states have call predecessors, (11), 12 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-04-02 21:51:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2023-04-02 21:51:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 21:51:22,152 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:22,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:22,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:22,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:22,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 231591004, now seen corresponding path program 4 times [2023-04-02 21:51:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:22,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249073339] [2023-04-02 21:51:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:22,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 21:51:22,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249073339] [2023-04-02 21:51:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249073339] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879437509] [2023-04-02 21:51:22,429 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 21:51:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:22,445 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:22,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-02 21:51:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:22,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 21:51:22,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 21:51:22,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 21:51:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879437509] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249913589] [2023-04-02 21:51:22,686 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:22,687 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:22,687 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:22,687 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:22,687 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:22,697 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:22,868 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:22,880 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:23,018 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:23,026 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 28 for LOIs [2023-04-02 21:51:23,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:23,058 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:23,977 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3193#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~len~0 2) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:23,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:23,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-04-02 21:51:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400666924] [2023-04-02 21:51:23,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 21:51:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 21:51:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1114, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 21:51:23,980 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-02 21:51:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:24,095 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2023-04-02 21:51:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 21:51:24,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 48 [2023-04-02 21:51:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:24,098 INFO L225 Difference]: With dead ends: 95 [2023-04-02 21:51:24,098 INFO L226 Difference]: Without dead ends: 66 [2023-04-02 21:51:24,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 21:51:24,099 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:24,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 127 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 21:51:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-04-02 21:51:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-04-02 21:51:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (13), 9 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-02 21:51:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-04-02 21:51:24,123 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 48 [2023-04-02 21:51:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:24,124 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-04-02 21:51:24,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-02 21:51:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-04-02 21:51:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 21:51:24,128 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:24,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:24,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-02 21:51:24,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:24,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:24,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash 95505090, now seen corresponding path program 5 times [2023-04-02 21:51:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970569467] [2023-04-02 21:51:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 21:51:24,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970569467] [2023-04-02 21:51:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970569467] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031023364] [2023-04-02 21:51:24,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 21:51:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:24,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:24,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-02 21:51:24,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 21:51:24,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:51:24,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:51:24,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 21:51:24,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 21:51:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031023364] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:51:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 10 [2023-04-02 21:51:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496901089] [2023-04-02 21:51:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:24,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 21:51:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 21:51:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 21:51:24,685 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 21:51:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:24,722 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2023-04-02 21:51:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 21:51:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2023-04-02 21:51:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:24,723 INFO L225 Difference]: With dead ends: 79 [2023-04-02 21:51:24,723 INFO L226 Difference]: Without dead ends: 64 [2023-04-02 21:51:24,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-02 21:51:24,724 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:24,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 21:51:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-02 21:51:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-04-02 21:51:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-04-02 21:51:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2023-04-02 21:51:24,734 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 48 [2023-04-02 21:51:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:24,735 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2023-04-02 21:51:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-02 21:51:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2023-04-02 21:51:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 21:51:24,736 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:24,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:24,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:24,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-02 21:51:24,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:24,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1613471184, now seen corresponding path program 6 times [2023-04-02 21:51:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964018825] [2023-04-02 21:51:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 21:51:25,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964018825] [2023-04-02 21:51:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964018825] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798427537] [2023-04-02 21:51:25,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 21:51:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:25,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 21:51:25,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 21:51:25,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:51:25,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 21:51:25,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 21:51:25,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 21:51:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798427537] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:51:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 11 [2023-04-02 21:51:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190597623] [2023-04-02 21:51:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:25,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 21:51:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 21:51:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-04-02 21:51:25,251 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 21:51:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:25,306 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-04-02 21:51:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 21:51:25,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2023-04-02 21:51:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:25,307 INFO L225 Difference]: With dead ends: 78 [2023-04-02 21:51:25,307 INFO L226 Difference]: Without dead ends: 63 [2023-04-02 21:51:25,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-02 21:51:25,308 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:25,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 21:51:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-02 21:51:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-04-02 21:51:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-02 21:51:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-04-02 21:51:25,319 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 48 [2023-04-02 21:51:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:25,319 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-04-02 21:51:25,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 21:51:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-04-02 21:51:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-02 21:51:25,320 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:25,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:25,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:25,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-02 21:51:25,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:25,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2023372255, now seen corresponding path program 7 times [2023-04-02 21:51:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572858175] [2023-04-02 21:51:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 21:51:25,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572858175] [2023-04-02 21:51:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572858175] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795524962] [2023-04-02 21:51:25,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-02 21:51:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:25,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:25,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-02 21:51:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:25,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 21:51:25,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 21:51:25,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-02 21:51:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795524962] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [6961893] [2023-04-02 21:51:25,862 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:25,862 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:25,877 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:25,877 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:25,877 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:25,886 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:26,059 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 13 for LOIs [2023-04-02 21:51:26,067 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:26,229 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:26,237 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 30 for LOIs [2023-04-02 21:51:26,265 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:26,267 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:27,231 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4873#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= 3 main_~expected~0) (= main_~i~0 1) (= main_~len~0 2) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:27,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:27,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-04-02 21:51:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559747911] [2023-04-02 21:51:27,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:27,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 21:51:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 21:51:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 21:51:27,233 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-02 21:51:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:27,325 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2023-04-02 21:51:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 21:51:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 54 [2023-04-02 21:51:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:27,327 INFO L225 Difference]: With dead ends: 78 [2023-04-02 21:51:27,327 INFO L226 Difference]: Without dead ends: 52 [2023-04-02 21:51:27,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 21:51:27,328 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:27,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 127 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 21:51:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-02 21:51:27,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-04-02 21:51:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-02 21:51:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-04-02 21:51:27,343 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 54 [2023-04-02 21:51:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:27,344 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-04-02 21:51:27,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-02 21:51:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-04-02 21:51:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-02 21:51:27,344 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:27,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:51:27,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:27,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-02 21:51:27,554 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:27,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -606816158, now seen corresponding path program 1 times [2023-04-02 21:51:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273064780] [2023-04-02 21:51:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 21:51:27,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:27,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273064780] [2023-04-02 21:51:27,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273064780] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:27,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547367005] [2023-04-02 21:51:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:27,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:27,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:27,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:27,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-02 21:51:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:27,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 59 conjunts are in the unsatisfiable core [2023-04-02 21:51:27,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:28,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 21:51:28,234 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-04-02 21:51:28,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2023-04-02 21:51:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 21:51:28,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:28,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-04-02 21:51:28,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:51:28,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:51:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 21:51:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547367005] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:51:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321142088] [2023-04-02 21:51:28,614 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2023-04-02 21:51:28,615 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:51:28,615 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:51:28,615 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:51:28,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:51:28,624 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:51:28,827 INFO L197 IcfgInterpreter]: Interpreting procedure sll_get_data_at with input of size 15 for LOIs [2023-04-02 21:51:28,839 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 29 for LOIs [2023-04-02 21:51:29,000 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-04-02 21:51:29,008 INFO L197 IcfgInterpreter]: Interpreting procedure sll_update_at with input of size 30 for LOIs [2023-04-02 21:51:29,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:51:29,042 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:51:30,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5470#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= (+ main_~i~0 2) main_~expected~0) (<= main_~i~0 1) (= main_~len~0 2) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= main_~s~0.offset 0) (= |#NULL.base| 0))' at error location [2023-04-02 21:51:30,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:51:30,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:51:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 32 [2023-04-02 21:51:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164775473] [2023-04-02 21:51:30,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:51:30,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-02 21:51:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-02 21:51:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-04-02 21:51:30,534 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 32 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 32 states have internal predecessors, (61), 11 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-04-02 21:51:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:31,018 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-04-02 21:51:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 21:51:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 32 states have internal predecessors, (61), 11 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2023-04-02 21:51:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:31,019 INFO L225 Difference]: With dead ends: 63 [2023-04-02 21:51:31,019 INFO L226 Difference]: Without dead ends: 60 [2023-04-02 21:51:31,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 111 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=324, Invalid=4098, Unknown=0, NotChecked=0, Total=4422 [2023-04-02 21:51:31,021 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:31,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 260 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-02 21:51:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-02 21:51:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2023-04-02 21:51:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 21:51:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-04-02 21:51:31,031 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 54 [2023-04-02 21:51:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:31,032 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-04-02 21:51:31,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 32 states have internal predecessors, (61), 11 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-04-02 21:51:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-04-02 21:51:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-02 21:51:31,032 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:51:31,032 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02 21:51:31,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:31,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-02 21:51:31,238 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:51:31,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:51:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash -803395108, now seen corresponding path program 2 times [2023-04-02 21:51:31,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:51:31,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11188095] [2023-04-02 21:51:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:51:31,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:51:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:51:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 21:51:31,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:51:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11188095] [2023-04-02 21:51:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11188095] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521277103] [2023-04-02 21:51:31,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 21:51:31,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:51:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:51:31,318 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:51:31,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-02 21:51:31,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 21:51:31,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:51:31,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-02 21:51:31,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:51:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 21:51:31,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:51:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 21:51:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521277103] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 21:51:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:51:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 11 [2023-04-02 21:51:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286770005] [2023-04-02 21:51:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:51:31,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 21:51:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:51:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 21:51:31,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-04-02 21:51:31,577 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 21:51:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:51:31,654 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-04-02 21:51:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 21:51:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-04-02 21:51:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:51:31,654 INFO L225 Difference]: With dead ends: 68 [2023-04-02 21:51:31,654 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 21:51:31,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-02 21:51:31,657 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:51:31,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 21:51:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 21:51:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 21:51:31,658 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-02 21:51:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 21:51:31,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-04-02 21:51:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:51:31,658 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 21:51:31,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-02 21:51:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 21:51:31,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 21:51:31,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 21:51:31,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-02 21:51:31,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-02 21:51:31,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 21:51:34,257 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 21:51:34,257 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 21:51:34,258 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse2 (= 2 (select |#length| 1))) (.cse5 (= (select |#valid| 1) 1)) (.cse4 (= (select |#valid| 0) 0)) (.cse9 (= (select |#valid| 2) 1)) (.cse0 (= 27 (select |#length| 2))) (.cse10 (= (+ 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|)) (.cse17 (= |sll_update_at_#in~head.offset| 0)) (.cse19 (= |#NULL.offset| 0)) (.cse16 (= |#NULL.base| 0))) (let ((.cse11 (= |#memory_int| |old(#memory_int)|)) (.cse12 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse13 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse14 (let ((.cse20 (<= 0 sll_update_at_~index)) (.cse21 (<= (+ |sll_update_at_#in~data| |sll_update_at_#in~index|) 4))) (or (let ((.cse22 (select |#memory_int| 1))) (and .cse2 .cse10 .cse20 .cse5 .cse21 .cse17 .cse4 .cse9 .cse19 (= (select .cse22 0) 48) .cse0 (= (select .cse22 1) 0) (< 0 |#StackHeapBarrier|) .cse16)) (and .cse10 .cse20 .cse21 .cse17 (<= |sll_update_at_#in~data| (+ 2 |#StackHeapBarrier|)) (<= 3 (+ sll_update_at_~data |#StackHeapBarrier|)) .cse19 .cse16)))) (.cse15 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (let ((.cse1 (not .cse19)) (.cse3 (let ((.cse18 (+ |sll_update_at_#in~head.offset| 4))) (and .cse11 (<= (+ sll_update_at_~index 1) |sll_update_at_#in~index|) .cse12 .cse13 .cse14 .cse15 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse18) sll_update_at_~head.offset) (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse18) sll_update_at_~head.base)))) (.cse6 (not .cse17)) (.cse7 (not .cse16))) (and (let ((.cse8 (select |old(#memory_int)| 1))) (or (not .cse0) .cse1 (not .cse2) .cse3 (not .cse4) (not .cse5) .cse6 .cse7 (= sll_update_at_~index 1) (not (= 3 |sll_update_at_#in~data|)) (not (= (select .cse8 0) 48)) (not .cse9) (<= |#StackHeapBarrier| 0) (not (= (select .cse8 1) 0)) (not (= |sll_update_at_#in~index| 1)))) (or (not .cse10) .cse1 .cse3 (< 3 |sll_update_at_#in~data|) .cse6 (< |sll_update_at_#in~data| 2) .cse7 (< |#StackHeapBarrier| 1) (and .cse11 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse12 .cse13 .cse14 (<= sll_update_at_~index |sll_update_at_#in~index|) .cse15 (= |sll_update_at_#in~head.base| sll_update_at_~head.base))))))) [2023-04-02 21:51:34,258 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 606 612) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (+ 2 |sll_update_at_#in~index|) |sll_update_at_#in~data|)) (not (= |#NULL.offset| 0)) (< 3 |sll_update_at_#in~data|) (not (= |sll_update_at_#in~head.offset| 0)) (< |sll_update_at_#in~data| 2) (not (= |#NULL.base| 0)) (< |#StackHeapBarrier| 1)) [2023-04-02 21:51:34,258 INFO L899 garLoopResultBuilder]: For program point sll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2023-04-02 21:51:34,258 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2023-04-02 21:51:34,258 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 571 573) the Hoare annotation is: true [2023-04-02 21:51:34,258 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 571 573) no Hoare annotation was computed. [2023-04-02 21:51:34,258 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-04-02 21:51:34,258 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 592 598) the Hoare annotation is: true [2023-04-02 21:51:34,258 INFO L899 garLoopResultBuilder]: For program point sll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2023-04-02 21:51:34,258 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse0 (not (= |#NULL.offset| 0))) (.cse3 (forall ((v_main_~s~0.base_BEFORE_CALL_70 Int) (v_main_~s~0.offset_BEFORE_CALL_70 Int)) (let ((.cse8 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_70) v_main_~s~0.offset_BEFORE_CALL_70))) (or (< .cse8 2) (< 2 .cse8))))) (.cse4 (not (= |#NULL.base| 0))) (.cse5 (< |#StackHeapBarrier| 1))) (and (let ((.cse1 (<= sll_get_data_at_~index 0)) (.cse2 (<= 1 |sll_get_data_at_#in~index|))) (or .cse0 (and (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|) (or .cse1 .cse2) (< sll_get_data_at_~index 2) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|)) (and .cse1 .cse2) .cse3 (<= 2 |sll_get_data_at_#in~index|) .cse4 .cse5)) (or (= sll_get_data_at_~index 1) .cse0 (and (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) 4)) (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) 4))) (forall ((v_main_~s~0.offset_BEFORE_CALL_38 Int) (v_main_~s~0.base_BEFORE_CALL_38 Int)) (let ((.cse7 (+ v_main_~s~0.offset_BEFORE_CALL_38 4))) (let ((.cse6 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_38) .cse7))) (or (not (= (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_38) .cse7)) 3)) (= v_main_~s~0.base_BEFORE_CALL_38 .cse6))))) (not (= |sll_get_data_at_#in~head.offset| 0)) (not (= |sll_get_data_at_#in~index| 1)) .cse3 .cse4 .cse5))) [2023-04-02 21:51:34,258 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 599 605) the Hoare annotation is: true [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point sll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point sll_createEXIT(lines 583 591) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse17 (select |#memory_int| 1))) (let ((.cse1 (= 1 sll_create_~data)) (.cse2 (< 0 sll_create_~len)) (.cse3 (<= sll_create_~len 2)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (= |sll_create_#in~len| 2)) (.cse6 (= (select |#valid| 1) 1)) (.cse7 (= (select |#valid| 0) 0)) (.cse8 (= |sll_create_#in~data| 1)) (.cse9 (= (select |#valid| 2) 1)) (.cse0 (= |#NULL.offset| 0)) (.cse10 (= (select .cse17 0) 48)) (.cse11 (= 27 (select |#length| 2))) (.cse12 (<= (+ sll_create_~head~0.base 1) |#StackHeapBarrier|)) (.cse13 (= (select .cse17 1) 0)) (.cse14 (= sll_create_~head~0.offset 0)) (.cse15 (= |#NULL.base| 0)) (.cse16 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select |#valid| sll_create_~head~0.base) 1)) (not .cse5) (not .cse15) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse16 0) 48)) (not .cse8) (not (= (select |old(#valid)| 0) 0)) (and .cse1 .cse2 (= |#memory_int| |old(#memory_int)|) .cse3 .cse4 .cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse6 .cse7 .cse8 .cse9 .cse0 (= 2 sll_create_~len) .cse10 .cse11 .cse12 (= |old(#valid)| |#valid|) .cse13 .cse14 .cse15) (<= |#StackHeapBarrier| 0) (not (= (select .cse16 1) 0))))) [2023-04-02 21:51:34,259 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 583 591) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (not (= |sll_create_#in~data| 1)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)))) [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse13 (select |#memory_int| 1))) (let ((.cse1 (<= sll_create_~len 2)) (.cse2 (= 2 (select |#length| 1))) (.cse3 (= (select |#valid| 1) 1)) (.cse4 (= (select |#valid| 0) 0)) (.cse5 (= (select |#valid| 2) 1)) (.cse6 (= (select .cse13 0) 48)) (.cse7 (= 27 (select |#length| 2))) (.cse9 (= (select .cse13 1) 0)) (.cse11 (= (select |#valid| sll_create_~head~0.base) 1)) (.cse0 (= 1 sll_create_~data)) (.cse8 (<= (+ sll_create_~head~0.base 1) |#StackHeapBarrier|)) (.cse10 (= sll_create_~head~0.offset 0)) (.cse12 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 sll_create_~len) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= |sll_create_#in~len| 2)) (not (= |#NULL.base| 0)) (and .cse0 (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 4))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= (select |old(#length)| 1) 2)) (and .cse0 (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 2 sll_create_~len) .cse8 (= |old(#valid)| |#valid|) .cse10) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse12 0) 48)) (not (= |sll_create_#in~data| 1)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse12 1) 0))))) [2023-04-02 21:51:34,259 INFO L902 garLoopResultBuilder]: At program point L577(line 577) the Hoare annotation is: true [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2023-04-02 21:51:34,259 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |node_create_#in~data| 1)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)))) [2023-04-02 21:51:34,259 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point L628(line 628) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L895 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (let ((.cse7 (select |old(#memory_int)| 1)) (.cse0 (= main_~data~0 1)) (.cse1 (<= 2 main_~new_data~0)) (.cse3 (= main_~len~0 2)) (.cse4 (<= main_~new_data~0 2)) (.cse5 (= main_~s~0.offset 0)) (.cse6 (select |#memory_int| main_~s~0.base))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse2 (select .cse6 main_~s~0.offset))) (and .cse0 .cse1 (<= 2 .cse2) (<= .cse2 2) .cse3 .cse4 (= main_~i~0 0) (= 2 main_~expected~0) .cse5)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse7 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse7 1) 0)) (let ((.cse9 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse10 (select (select |#memory_int| .cse9) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse8 (select .cse6 0))) (and .cse0 .cse1 (<= .cse8 2) (= 3 main_~expected~0) (not (= main_~s~0.base .cse9)) (= main_~i~0 1) (<= 3 .cse10) .cse3 .cse4 (<= .cse10 3) (<= 2 .cse8) .cse5))))) [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point L624-1(line 624) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point L624-2(lines 624 626) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L895 garLoopResultBuilder]: At program point L620(line 620) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse0 (= main_~data~0 1)) (.cse1 (not (= main_~s~0.base .cse5))) (.cse3 (= main_~len~0 2)) (.cse4 (= main_~s~0.offset 0)) (.cse7 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse2 (select (select |#memory_int| .cse5) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (and .cse0 .cse1 (<= 3 .cse2) .cse3 (<= .cse2 3) (= main_~i~0 0) (= 2 main_~new_data~0) .cse4)) (let ((.cse6 (select |#memory_int| 1))) (and .cse0 .cse1 (= 2 (select |#length| 1)) (= main_~i~0 1) .cse3 (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse6 0) 48) (= 27 (select |#length| 2)) (= 3 main_~new_data~0) (= (select .cse6 1) 0) .cse4)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse7 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse7 1) 0))))) [2023-04-02 21:51:34,260 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2023-04-02 21:51:34,260 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse0 (= |#NULL.offset| 0)) (.cse1 (= main_~data~0 1)) (.cse2 (<= 2 main_~new_data~0)) (.cse5 (= main_~len~0 2)) (.cse6 (<= main_~new_data~0 2)) (.cse7 (= main_~s~0.offset 0)) (.cse9 (select |#memory_int| main_~s~0.base)) (.cse10 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not .cse0) (and (<= main_~i~0 0) (let ((.cse8 (select .cse9 main_~s~0.offset))) (let ((.cse3 (<= 2 .cse8)) (.cse4 (<= .cse8 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 main_~expected~0) .cse0 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~i~0 0) .cse0 .cse7))))) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse10 0) 48)) (let ((.cse12 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse13 (select (select |#memory_int| .cse12) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4))) (.cse11 (select .cse9 0))) (and .cse1 .cse2 (<= .cse11 2) (not (= main_~s~0.base .cse12)) (= main_~i~0 1) (<= 3 .cse13) .cse5 .cse6 (<= .cse13 3) (<= 2 .cse11) .cse7))) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse10 1) 0)))) [2023-04-02 21:51:34,260 INFO L895 garLoopResultBuilder]: At program point L622-4(lines 622 627) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (= main_~len~0 2) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 21:51:34,261 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 632) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)))) [2023-04-02 21:51:34,261 INFO L895 garLoopResultBuilder]: At program point L616(line 616) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (and (= main_~data~0 1) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= main_~len~0 2) (= |old(#valid)| |#valid|)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 21:51:34,261 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| main_~s~0.base) 4))) (let ((.cse9 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| main_~s~0.base) 4)))) (let ((.cse7 (select |old(#memory_int)| 1)) (.cse0 (= main_~data~0 1)) (.cse1 (not (= main_~s~0.base .cse10))) (.cse2 (<= 3 .cse9)) (.cse3 (= main_~len~0 2)) (.cse4 (<= .cse9 3)) (.cse5 (= main_~s~0.offset 0))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~i~0 0) (= 3 main_~new_data~0) .cse5) (let ((.cse6 (select |#memory_int| 1))) (and .cse0 .cse1 (= 2 (select |#length| 1)) (= main_~i~0 1) .cse3 (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse6 0) 48) (= 27 (select |#length| 2)) (= (select .cse6 1) 0) .cse5)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse7 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse7 1) 0)) (let ((.cse8 (select (select |#memory_int| main_~s~0.base) 0))) (and .cse0 (<= 2 main_~new_data~0) (<= .cse8 2) .cse1 (<= main_~i~0 0) .cse2 .cse3 (<= main_~new_data~0 2) .cse4 (<= 2 .cse8) .cse5)))))) [2023-04-02 21:51:34,261 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 613 632) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 27)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-02 21:51:34,262 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-02 21:51:34,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 21:51:34,262 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 21:51:34,264 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2023-04-02 21:51:34,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 21:51:34,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,280 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,296 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 09:51:34 BoogieIcfgContainer [2023-04-02 21:51:34,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 21:51:34,322 INFO L158 Benchmark]: Toolchain (without parser) took 34774.93ms. Allocated memory was 268.4MB in the beginning and 701.5MB in the end (delta: 433.1MB). Free memory was 232.1MB in the beginning and 562.8MB in the end (delta: -330.7MB). Peak memory consumption was 427.2MB. Max. memory is 8.0GB. [2023-04-02 21:51:34,322 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 21:51:34,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.67ms. Allocated memory is still 268.4MB. Free memory was 232.1MB in the beginning and 214.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 21:51:34,322 INFO L158 Benchmark]: Boogie Preprocessor took 59.61ms. Allocated memory is still 268.4MB. Free memory was 214.8MB in the beginning and 212.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-02 21:51:34,325 INFO L158 Benchmark]: RCFGBuilder took 558.48ms. Allocated memory is still 268.4MB. Free memory was 212.2MB in the beginning and 186.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-04-02 21:51:34,325 INFO L158 Benchmark]: TraceAbstraction took 33860.05ms. Allocated memory was 268.4MB in the beginning and 701.5MB in the end (delta: 433.1MB). Free memory was 185.5MB in the beginning and 562.8MB in the end (delta: -377.3MB). Peak memory consumption was 381.1MB. Max. memory is 8.0GB. [2023-04-02 21:51:34,327 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.10ms. Allocated memory is still 209.7MB. Free memory is still 156.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.67ms. Allocated memory is still 268.4MB. Free memory was 232.1MB in the beginning and 214.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.61ms. Allocated memory is still 268.4MB. Free memory was 214.8MB in the beginning and 212.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 558.48ms. Allocated memory is still 268.4MB. Free memory was 212.2MB in the beginning and 186.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 33860.05ms. Allocated memory was 268.4MB in the beginning and 701.5MB in the end (delta: 433.1MB). Free memory was 185.5MB in the beginning and 562.8MB in the end (delta: -377.3MB). Peak memory consumption was 381.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 630]: 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 12 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 1440 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 99 IncrementalHoareTripleChecker+Unchecked, 1195 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4113 IncrementalHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 245 mSDtfsCounter, 4113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1063 SyntacticMatches, 38 SemanticMatches, 500 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8978 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 78 PreInvPairs, 107 NumberOfFragments, 2409 HoareAnnotationTreeSize, 78 FomulaSimplifications, 19387 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 7024 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1496 ConstructedInterpolants, 13 QuantifiedInterpolants, 4622 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3640 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 498/601 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: OVERALL_TIME: 1.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 18, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 74, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 97, TOOLS_POST_TIME: 0.2s, TOOLS_POST_CALL_APPLICATIONS: 69, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 54, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 219, TOOLS_QUANTIFIERELIM_TIME: 1.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.0s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 322, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 32, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 9, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 19, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 74, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 10, LOOP_SUMMARIZER_CACHE_MISSES: 10, LOOP_SUMMARIZER_OVERALL_TIME: 1.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 19, CALL_SUMMARIZER_APPLICATIONS: 54, CALL_SUMMARIZER_CACHE_MISSES: 12, CALL_SUMMARIZER_OVERALL_TIME: 0.4s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 644, DAG_COMPRESSION_RETAINED_NODES: 287, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 607]: Loop Invariant [2023-04-02 21:51:34,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((!(27 == unknown-#length-unknown[2]) || !(#NULL == 0)) || !(2 == unknown-#length-unknown[1])) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && ((((((((((((((2 == unknown-#length-unknown[1] && 2 + \old(index) == \old(data)) && 0 <= index) && \valid[1] == 1) && \old(data) + \old(index) <= 4) && head == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((2 + \old(index) == \old(data) && 0 <= index) && \old(data) + \old(index) <= 4) && head == 0) && \old(data) <= 2 + unknown-#StackHeapBarrier-unknown) && 3 <= data + unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #NULL == 0))) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$[head][head + 4] == head) && #memory_$Pointer$[head][head + 4] == head)) || !(\valid[0] == 0)) || !(\valid[1] == 1)) || !(head == 0)) || !(#NULL == 0)) || index == 1) || !(3 == \old(data))) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\valid[2] == 1)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || !(\old(index) == 1)) && ((((((((!(2 + \old(index) == \old(data)) || !(#NULL == 0)) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && index + 1 <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && ((((((((((((((2 == unknown-#length-unknown[1] && 2 + \old(index) == \old(data)) && 0 <= index) && \valid[1] == 1) && \old(data) + \old(index) <= 4) && head == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((2 + \old(index) == \old(data) && 0 <= index) && \old(data) + \old(index) <= 4) && head == 0) && \old(data) <= 2 + unknown-#StackHeapBarrier-unknown) && 3 <= data + unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #NULL == 0))) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$[head][head + 4] == head) && #memory_$Pointer$[head][head + 4] == head)) || 3 < \old(data)) || !(head == 0)) || \old(data) < 2) || !(#NULL == 0)) || unknown-#StackHeapBarrier-unknown < 1) || (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && head == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && data == \old(data)) && ((((((((((((((2 == unknown-#length-unknown[1] && 2 + \old(index) == \old(data)) && 0 <= index) && \valid[1] == 1) && \old(data) + \old(index) <= 4) && head == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((2 + \old(index) == \old(data) && 0 <= index) && \old(data) + \old(index) <= 4) && head == 0) && \old(data) <= 2 + unknown-#StackHeapBarrier-unknown) && 3 <= data + unknown-#StackHeapBarrier-unknown) && #NULL == 0) && #NULL == 0))) && index <= \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2023-04-02 21:51:34,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((((1 == data && len <= 2) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && 1 <= len) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][1] == 0) && head == 0) && \valid[head] == 1)) || !(\old(len) == 2)) || !(#NULL == 0)) || ((((((((((((1 == data && !(head == #memory_$Pointer$[head][4])) && len <= 2) && 2 == unknown-#length-unknown[1]) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && head + 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[1][1] == 0) && head == 0) && \valid[head] == 1)) || !(\old(unknown-#length-unknown)[1] == 2)) || ((((((((1 == data && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 == len) && head + 1 <= unknown-#StackHeapBarrier-unknown) && \old(\valid) == \valid) && head == 0)) || !(\old(unknown-#length-unknown)[2] == 27)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(data) == 1)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 618]: Loop Invariant [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || (((((((data == 1 && !(s == #memory_$Pointer$[s][4])) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && i == 0) && 3 == new_data) && s == 0)) || (((((((((((data == 1 && !(s == #memory_$Pointer$[s][4])) && 2 == unknown-#length-unknown[1]) && i == 1) && len == 2) && \valid[1] == 1) && \valid[0] == 0) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && s == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 27)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0)) || ((((((((((data == 1 && 2 <= new_data) && unknown-#memory_int-unknown[s][0] <= 2) && !(s == #memory_$Pointer$[s][4])) && i <= 0) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 27)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 600]: Loop Invariant [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,347 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,348 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_38,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_70,QUANTIFIED] [2023-04-02 21:51:34,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_70,QUANTIFIED] Derived loop invariant: ((((((!(#NULL == 0) || (((head == head && (index <= 0 || 1 <= \old(index))) && index < 2) && head == head)) || (index <= 0 && 1 <= \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_70 : int, v_main_~s~0.offset_BEFORE_CALL_70 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_70][v_main_~s~0.offset_BEFORE_CALL_70] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_70][v_main_~s~0.offset_BEFORE_CALL_70])) || 2 <= \old(index)) || !(#NULL == 0)) || unknown-#StackHeapBarrier-unknown < 1) && ((((((((index == 1 || !(#NULL == 0)) || (head == #memory_$Pointer$[head][4] && head == #memory_$Pointer$[head][4])) || (forall v_main_~s~0.offset_BEFORE_CALL_38 : int, v_main_~s~0.base_BEFORE_CALL_38 : int :: !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_38][v_main_~s~0.offset_BEFORE_CALL_38 + 4]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_38][v_main_~s~0.offset_BEFORE_CALL_38 + 4]] == 3) || v_main_~s~0.base_BEFORE_CALL_38 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_38][v_main_~s~0.offset_BEFORE_CALL_38 + 4])) || !(head == 0)) || !(\old(index) == 1)) || (forall v_main_~s~0.base_BEFORE_CALL_70 : int, v_main_~s~0.offset_BEFORE_CALL_70 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_70][v_main_~s~0.offset_BEFORE_CALL_70] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_70][v_main_~s~0.offset_BEFORE_CALL_70])) || !(#NULL == 0)) || unknown-#StackHeapBarrier-unknown < 1) - InvariantResult [Line: 622]: Loop Invariant [2023-04-02 21:51:34,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 21:51:34,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 21:51:34,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || (i <= 0 && (((((((((data == 1 && 2 <= new_data) && 2 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] <= 2) && len == 2) && new_data <= 2) && 2 == expected) && #NULL == 0) && s == 0) || ((((((((data == 1 && 2 <= new_data) && 2 <= unknown-#memory_int-unknown[s][s]) && unknown-#memory_int-unknown[s][s] <= 2) && len == 2) && new_data <= 2) && i == 0) && #NULL == 0) && s == 0)))) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 27)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || ((((((((((data == 1 && 2 <= new_data) && unknown-#memory_int-unknown[s][0] <= 2) && !(s == #memory_$Pointer$[s][4])) && i == 1) && 3 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && len == 2) && new_data <= 2) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 3) && 2 <= unknown-#memory_int-unknown[s][0]) && s == 0)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) RESULT: Ultimate proved your program to be correct! [2023-04-02 21:51:34,391 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...