/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:04:35,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:04:35,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:04:35,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:04:35,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:04:35,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:04:35,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:04:35,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:04:35,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:04:35,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:04:35,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:04:35,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:04:35,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:04:35,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:04:35,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:04:35,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:04:35,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:04:35,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:04:35,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:04:35,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:04:35,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:04:35,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:04:35,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:04:35,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:04:35,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:04:35,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:04:35,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:04:35,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:04:35,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:04:35,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:04:35,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:04:35,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:04:35,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:04:35,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:04:35,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:04:35,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:04:35,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:04:35,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:04:35,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:04:35,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:04:35,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:04:35,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:04:35,783 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:04:35,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:04:35,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:04:35,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:04:35,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:04:35,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:04:35,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:04:35,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:04:35,786 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:04:35,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:04:35,786 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:04:35,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:04:35,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:04:35,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:04:35,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:04:35,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:04:35,789 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:04:35,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:04:35,789 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:04:35,789 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-02 01:04:35,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:04:35,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:04:35,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:04:35,993 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:04:35,993 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:04:35,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-04-02 01:04:36,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:04:37,126 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:04:37,127 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2023-04-02 01:04:37,144 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad863dd6f/e714c785fdf64f7ca4a3f045983befb9/FLAGfe22df8bd [2023-04-02 01:04:37,154 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad863dd6f/e714c785fdf64f7ca4a3f045983befb9 [2023-04-02 01:04:37,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:04:37,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:04:37,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:04:37,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:04:37,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:04:37,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7104f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37, skipping insertion in model container [2023-04-02 01:04:37,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:04:37,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:04:37,378 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/dll2c_remove_all_reverse.i[24177,24190] [2023-04-02 01:04:37,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:04:37,392 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:04:37,422 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/dll2c_remove_all_reverse.i[24177,24190] [2023-04-02 01:04:37,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:04:37,439 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:04:37,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37 WrapperNode [2023-04-02 01:04:37,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:04:37,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:04:37,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:04:37,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:04:37,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,474 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:04:37,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:04:37,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:04:37,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:04:37,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (1/1) ... [2023-04-02 01:04:37,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:04:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:04:37,506 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 01:04:37,509 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 01:04:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:04:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:04:37,536 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_remove_last [2023-04-02 01:04:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:04:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:04:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:04:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:04:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:04:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:04:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:04:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:04:37,542 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:04:37,543 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:04:37,544 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:04:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:04:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:04:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 01:04:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_remove_last [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:04:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:04:37,741 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:04:37,742 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:04:37,826 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 01:04:37,910 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:04:37,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:04:37,914 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-02 01:04:37,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:04:37 BoogieIcfgContainer [2023-04-02 01:04:37,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:04:37,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:04:37,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:04:37,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:04:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:04:37" (1/3) ... [2023-04-02 01:04:37,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d48ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:04:37, skipping insertion in model container [2023-04-02 01:04:37,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:04:37" (2/3) ... [2023-04-02 01:04:37,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d48ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:04:37, skipping insertion in model container [2023-04-02 01:04:37,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:04:37" (3/3) ... [2023-04-02 01:04:37,921 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2023-04-02 01:04:37,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:04:37,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:04:38,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:04:38,012 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=PETRI_NET, 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;@688ab90a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:04:38,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:04:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:04:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:04:38,022 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:38,023 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] [2023-04-02 01:04:38,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:38,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 565340143, now seen corresponding path program 1 times [2023-04-02 01:04:38,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:38,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976994897] [2023-04-02 01:04:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,307 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 01:04:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976994897] [2023-04-02 01:04:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976994897] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:04:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:04:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 01:04:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149285876] [2023-04-02 01:04:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:04:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 01:04:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 01:04:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 01:04:38,332 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 01:04:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:38,490 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-04-02 01:04:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 01:04:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-04-02 01:04:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:38,497 INFO L225 Difference]: With dead ends: 61 [2023-04-02 01:04:38,498 INFO L226 Difference]: Without dead ends: 35 [2023-04-02 01:04:38,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:04:38,505 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 41 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:38,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:04:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-02 01:04:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-04-02 01:04:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:04:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-04-02 01:04:38,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2023-04-02 01:04:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:38,543 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-04-02 01:04:38,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 01:04:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-04-02 01:04:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 01:04:38,545 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:38,545 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] [2023-04-02 01:04:38,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:04:38,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:38,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 565131606, now seen corresponding path program 1 times [2023-04-02 01:04:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385466262] [2023-04-02 01:04:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:38,836 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 01:04:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385466262] [2023-04-02 01:04:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385466262] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:04:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:04:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-02 01:04:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991975697] [2023-04-02 01:04:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:04:38,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-02 01:04:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:38,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-02 01:04:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:04:38,841 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:04:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:39,039 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-04-02 01:04:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 01:04:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2023-04-02 01:04:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:39,041 INFO L225 Difference]: With dead ends: 55 [2023-04-02 01:04:39,042 INFO L226 Difference]: Without dead ends: 40 [2023-04-02 01:04:39,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-04-02 01:04:39,046 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:39,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 9 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:04:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-02 01:04:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-04-02 01:04:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:04:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-04-02 01:04:39,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2023-04-02 01:04:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:39,060 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-04-02 01:04:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:04:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-04-02 01:04:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 01:04:39,068 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:39,068 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 01:04:39,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:04:39,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:39,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2111760938, now seen corresponding path program 1 times [2023-04-02 01:04:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208564489] [2023-04-02 01:04:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:04:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:04:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208564489] [2023-04-02 01:04:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208564489] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:04:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:04:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:04:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517115081] [2023-04-02 01:04:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:04:39,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:04:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:04:39,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:04:39,277 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:04:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:39,411 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-04-02 01:04:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 01:04:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-04-02 01:04:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:39,413 INFO L225 Difference]: With dead ends: 43 [2023-04-02 01:04:39,413 INFO L226 Difference]: Without dead ends: 39 [2023-04-02 01:04:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:04:39,418 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:39,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:04:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-02 01:04:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-04-02 01:04:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:04:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-04-02 01:04:39,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2023-04-02 01:04:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:39,432 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-04-02 01:04:39,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 01:04:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-04-02 01:04:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-02 01:04:39,433 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:39,433 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-04-02 01:04:39,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:04:39,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:39,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:39,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1671162440, now seen corresponding path program 1 times [2023-04-02 01:04:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866992134] [2023-04-02 01:04:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:04:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:04:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:04:39,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866992134] [2023-04-02 01:04:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866992134] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:04:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810476189] [2023-04-02 01:04:39,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:04:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:04:39,642 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 01:04:39,643 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 01:04:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:39,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 01:04:39,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:04:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:04:39,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:04:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-02 01:04:39,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810476189] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:04:39,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:04:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2023-04-02 01:04:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775154125] [2023-04-02 01:04:39,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:04:39,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 01:04:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 01:04:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:04:39,971 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 01:04:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:40,162 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2023-04-02 01:04:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 01:04:40,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2023-04-02 01:04:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:40,164 INFO L225 Difference]: With dead ends: 44 [2023-04-02 01:04:40,164 INFO L226 Difference]: Without dead ends: 40 [2023-04-02 01:04:40,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-04-02 01:04:40,168 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:40,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:04:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-02 01:04:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-04-02 01:04:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:04:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-04-02 01:04:40,179 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 41 [2023-04-02 01:04:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:40,180 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-04-02 01:04:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 01:04:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-04-02 01:04:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 01:04:40,182 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:40,182 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-04-02 01:04:40,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 01:04:40,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:04:40,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:40,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2142203498, now seen corresponding path program 2 times [2023-04-02 01:04:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247063443] [2023-04-02 01:04:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:04:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:04:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:04:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 01:04:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:40,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247063443] [2023-04-02 01:04:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247063443] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:04:40,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:04:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 01:04:40,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086253818] [2023-04-02 01:04:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:04:40,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:04:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:04:40,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:04:40,740 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 01:04:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:40,994 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2023-04-02 01:04:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:04:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2023-04-02 01:04:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:40,996 INFO L225 Difference]: With dead ends: 53 [2023-04-02 01:04:40,996 INFO L226 Difference]: Without dead ends: 49 [2023-04-02 01:04:40,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-04-02 01:04:40,997 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:40,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 11 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:04:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-02 01:04:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2023-04-02 01:04:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-02 01:04:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-04-02 01:04:41,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 48 [2023-04-02 01:04:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:41,003 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-04-02 01:04:41,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-04-02 01:04:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-04-02 01:04:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 01:04:41,003 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:41,004 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:04:41,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 01:04:41,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:41,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1332856872, now seen corresponding path program 1 times [2023-04-02 01:04:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511674477] [2023-04-02 01:04:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:04:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:04:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:04:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-02 01:04:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:42,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511674477] [2023-04-02 01:04:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511674477] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:04:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899691503] [2023-04-02 01:04:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:42,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:04:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:04:42,044 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 01:04:42,064 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 01:04:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:42,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 63 conjunts are in the unsatisfiable core [2023-04-02 01:04:42,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:04:42,313 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 01:04:42,317 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 01:04:42,438 WARN L861 $PredicateComparison]: unable to prove that (exists ((dll_circular_remove_last_~snd_to_last~0.base Int) (dll_circular_remove_last_~snd_to_last~0.offset Int)) (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)) (.cse2 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| .cse1 (store (select |c_old(#memory_$Pointer$.base)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.base)))) (store .cse0 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse0 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse0 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))))) (= (let ((.cse3 (store |c_old(#memory_$Pointer$.offset)| .cse1 (store (select |c_old(#memory_$Pointer$.offset)| .cse1) .cse2 dll_circular_remove_last_~snd_to_last~0.offset)))) (store .cse3 dll_circular_remove_last_~snd_to_last~0.base (store (select .cse3 dll_circular_remove_last_~snd_to_last~0.base) dll_circular_remove_last_~snd_to_last~0.offset (select (select .cse3 |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|)))) |c_#memory_$Pointer$.offset|)))) is different from true [2023-04-02 01:04:42,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:42,523 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-04-02 01:04:42,524 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 2 case distinctions, treesize of input 39 treesize of output 25 [2023-04-02 01:04:42,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:42,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:42,594 INFO L321 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-04-02 01:04:42,594 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 2 case distinctions, treesize of input 47 treesize of output 41 [2023-04-02 01:04:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-04-02 01:04:42,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:04:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899691503] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:04:42,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:04:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2023-04-02 01:04:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465664385] [2023-04-02 01:04:42,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:04:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-02 01:04:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:04:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-02 01:04:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2023-04-02 01:04:42,912 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-02 01:04:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:04:43,471 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-04-02 01:04:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 01:04:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2023-04-02 01:04:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:04:43,472 INFO L225 Difference]: With dead ends: 58 [2023-04-02 01:04:43,472 INFO L226 Difference]: Without dead ends: 40 [2023-04-02 01:04:43,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1021, Unknown=1, NotChecked=68, Total=1332 [2023-04-02 01:04:43,473 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-02 01:04:43,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 14 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 440 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2023-04-02 01:04:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-02 01:04:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-04-02 01:04:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:04:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-04-02 01:04:43,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 48 [2023-04-02 01:04:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:04:43,478 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-04-02 01:04:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 16 states have internal predecessors, (47), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-02 01:04:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-04-02 01:04:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 01:04:43,479 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:04:43,479 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-04-02 01:04:43,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 01:04:43,686 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,SelfDestructingSolverStorable5 [2023-04-02 01:04:43,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:04:43,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:04:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 52993194, now seen corresponding path program 1 times [2023-04-02 01:04:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:04:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925471426] [2023-04-02 01:04:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:04:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:04:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:04:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:04:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:04:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:04:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:04:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 01:04:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:04:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925471426] [2023-04-02 01:04:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925471426] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:04:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326886989] [2023-04-02 01:04:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:04:46,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:04:46,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:04:46,166 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 01:04:46,169 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 01:04:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:04:46,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 164 conjunts are in the unsatisfiable core [2023-04-02 01:04:46,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:04:46,596 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 01:04:46,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2023-04-02 01:04:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:46,931 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 21 treesize of output 21 [2023-04-02 01:04:46,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:46,987 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 21 treesize of output 21 [2023-04-02 01:04:47,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-02 01:04:47,051 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 01:04:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:47,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2023-04-02 01:04:47,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:47,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-04-02 01:04:47,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 01:04:47,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-04-02 01:04:47,203 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 8 treesize of output 7 [2023-04-02 01:04:47,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2023-04-02 01:04:47,302 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:04:47,303 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 19 treesize of output 19 [2023-04-02 01:04:47,540 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|))) (let ((.cse4 (select |c_old(#memory_$Pointer$.offset)| .cse3)) (.cse7 (select |c_old(#memory_$Pointer$.base)| .cse3)) (.cse5 (+ (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_remove_last_#in~head.base|) |c_dll_circular_remove_last_#in~head.offset|) 4))) (let ((.cse8 (select .cse7 .cse5)) (.cse9 (+ (select .cse4 .cse5) 4))) (let ((.cse2 (select (select |c_old(#memory_$Pointer$.offset)| .cse8) .cse9)) (.cse1 (select (select |c_old(#memory_$Pointer$.base)| .cse8) .cse9))) (and (exists ((v_ArrVal_1448 Int)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| .cse3 (store .cse4 .cse5 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1448))) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1447 Int)) (= (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse3 (store .cse7 .cse5 .cse1)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_1447))) |c_#memory_$Pointer$.base|))))))) is different from true [2023-04-02 01:04:47,580 INFO L321 Elim1Store]: treesize reduction 64, result has 25.6 percent of original size [2023-04-02 01:04:47,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 262 treesize of output 107 [2023-04-02 01:04:47,592 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 01:04:47,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 56 [2023-04-02 01:04:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-04-02 01:04:47,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:05:10,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326886989] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:05:10,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:05:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-04-02 01:05:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997063201] [2023-04-02 01:05:10,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:05:10,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-04-02 01:05:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:05:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-04-02 01:05:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2220, Unknown=7, NotChecked=94, Total=2450 [2023-04-02 01:05:10,465 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 46 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 35 states have internal predecessors, (64), 10 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-02 01:05:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:05:12,450 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-04-02 01:05:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 01:05:12,451 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 35 states have internal predecessors, (64), 10 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 48 [2023-04-02 01:05:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:05:12,451 INFO L225 Difference]: With dead ends: 69 [2023-04-02 01:05:12,452 INFO L226 Difference]: Without dead ends: 47 [2023-04-02 01:05:12,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=297, Invalid=4256, Unknown=7, NotChecked=132, Total=4692 [2023-04-02 01:05:12,453 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 87 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:05:12,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 33 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1435 Invalid, 0 Unknown, 59 Unchecked, 1.0s Time] [2023-04-02 01:05:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-04-02 01:05:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-04-02 01:05:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:05:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-04-02 01:05:12,460 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 48 [2023-04-02 01:05:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:05:12,460 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-04-02 01:05:12,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 35 states have internal predecessors, (64), 10 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-02 01:05:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-04-02 01:05:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-02 01:05:12,461 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:05:12,461 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2023-04-02 01:05:12,484 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 01:05:12,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:05:12,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:05:12,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:05:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 193541804, now seen corresponding path program 1 times [2023-04-02 01:05:12,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:05:12,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087069833] [2023-04-02 01:05:12,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:05:12,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:05:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:05:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:05:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:05:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:05:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 01:05:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 01:05:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:05:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:05:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087069833] [2023-04-02 01:05:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087069833] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:05:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752298348] [2023-04-02 01:05:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:05:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:05:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:05:12,874 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 01:05:12,876 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 01:05:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 9 conjunts are in the unsatisfiable core [2023-04-02 01:05:13,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:05:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:05:13,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:05:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 01:05:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752298348] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:05:13,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:05:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2023-04-02 01:05:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888363320] [2023-04-02 01:05:13,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:05:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:05:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:05:13,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:05:13,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:05:13,187 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:05:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:05:13,361 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2023-04-02 01:05:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-02 01:05:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2023-04-02 01:05:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:05:13,362 INFO L225 Difference]: With dead ends: 74 [2023-04-02 01:05:13,362 INFO L226 Difference]: Without dead ends: 45 [2023-04-02 01:05:13,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:05:13,363 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:05:13,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:05:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-02 01:05:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-02 01:05:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 01:05:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-04-02 01:05:13,367 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 48 [2023-04-02 01:05:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:05:13,368 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-04-02 01:05:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-02 01:05:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-04-02 01:05:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-02 01:05:13,368 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:05:13,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 01:05:13,378 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 01:05:13,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:05:13,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:05:13,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:05:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 793252222, now seen corresponding path program 2 times [2023-04-02 01:05:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:05:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578134281] [2023-04-02 01:05:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:05:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:05:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:05:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 01:05:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 01:05:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 01:05:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-02 01:05:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-02 01:05:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 01:05:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:05:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:05:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:05:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578134281] [2023-04-02 01:05:13,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578134281] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:05:13,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077118081] [2023-04-02 01:05:13,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:05:13,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:05:13,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:05:13,777 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 01:05:13,798 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 01:05:14,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:05:14,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:05:14,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 01:05:14,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:05:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:05:14,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:05:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:05:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077118081] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-02 01:05:14,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:05:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 13 [2023-04-02 01:05:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127250184] [2023-04-02 01:05:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:05:14,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:05:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:05:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:05:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:05:14,190 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-02 01:05:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:05:14,205 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-04-02 01:05:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:05:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2023-04-02 01:05:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:05:14,206 INFO L225 Difference]: With dead ends: 45 [2023-04-02 01:05:14,206 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 01:05:14,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-02 01:05:14,207 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:05:14,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:05:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 01:05:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 01:05:14,209 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 01:05:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 01:05:14,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2023-04-02 01:05:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:05:14,209 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 01:05:14,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-02 01:05:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 01:05:14,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 01:05:14,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:05:14,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 01:05:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:05:14,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 01:05:14,922 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-02 01:05:14,922 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2023-04-02 01:05:14,922 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-02 01:05:14,922 INFO L899 garLoopResultBuilder]: For program point dll_circular_createEXIT(lines 585 600) no Hoare annotation was computed. [2023-04-02 01:05:14,922 INFO L899 garLoopResultBuilder]: For program point dll_circular_createFINAL(lines 585 600) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (or (<= 3 |dll_circular_create_#in~len|) (<= |#StackHeapBarrier| 0) (let ((.cse0 (select |#memory_$Pointer$.offset| dll_circular_create_~head~0.base))) (and (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base) (= (select .cse0 4) 0) (= dll_circular_create_~head~0.offset 0) (= (store |old(#valid)| dll_circular_create_~head~0.base 1) |#valid|) (= dll_circular_create_~last~0.offset 0) (< dll_circular_create_~len 3) (not (= dll_circular_create_~head~0.base 0)) (= (select .cse0 0) 0)))) [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= dll_circular_create_~len |dll_circular_create_#in~len|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (<= |#StackHeapBarrier| 0)) [2023-04-02 01:05:14,923 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse1 (= dll_circular_create_~head~0.offset 0)) (.cse2 (= dll_circular_create_~last~0.offset 0))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| dll_circular_create_~head~0.base))) (and (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base) (= dll_circular_create_~len |dll_circular_create_#in~len|) (= (select .cse0 4) 0) .cse1 (= (store |old(#valid)| dll_circular_create_~head~0.base 1) |#valid|) .cse2 (not (= dll_circular_create_~head~0.base 0)) (= (select .cse0 0) 0))) (let ((.cse4 (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) 4)) (.cse3 (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base))) (and (<= dll_circular_create_~len 1) (= dll_circular_create_~new_head~0.offset 0) (<= (+ dll_circular_create_~head~0.base 1) |#StackHeapBarrier|) .cse1 .cse2 (= (select .cse3 4) 0) (= (select (store |old(#valid)| dll_circular_create_~last~0.base 1) dll_circular_create_~head~0.base) 0) (= dll_circular_create_~new_head~0.base .cse4) (= dll_circular_create_~head~0.base .cse4) (= (select .cse3 0) 0))) (<= 3 |dll_circular_create_#in~len|) (<= |#StackHeapBarrier| 0))) [2023-04-02 01:05:14,923 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 585 600) the Hoare annotation is: (or (<= |#StackHeapBarrier| 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 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2023-04-02 01:05:14,923 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point __bswap_32FINAL(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point __bswap_32EXIT(lines 74 78) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2023-04-02 01:05:14,923 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (or (<= |#StackHeapBarrier| 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 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L902 garLoopResultBuilder]: At program point L578(line 578) the Hoare annotation is: true [2023-04-02 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:05:14,924 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 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 625) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 613 627) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point L621(lines 621 623) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 613 627) no Hoare annotation was computed. [2023-04-02 01:05:14,924 INFO L895 garLoopResultBuilder]: At program point ERROR(lines 613 627) the Hoare annotation is: (<= |#StackHeapBarrier| 0) [2023-04-02 01:05:14,924 INFO L895 garLoopResultBuilder]: At program point L619(line 619) the Hoare annotation is: (let ((.cse7 (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|)) (.cse0 (= |main_~#s~0.offset| 0)) (.cse8 (<= main_~i~0 1)) (.cse3 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 0)) (.cse4 (= main_~len~0 2)) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (or (let ((.cse6 (select (select |#memory_$Pointer$.base| .cse1) 4))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse6)) (.cse5 (select |#memory_$Pointer$.offset| .cse6))) (and .cse0 (not (= |main_~#s~0.base| .cse1)) (= (select .cse2 4) .cse1) (= (select .cse2 0) .cse1) .cse3 .cse4 (= (select .cse5 0) 0) (= main_~i~0 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (not (= .cse6 .cse1)) (= (select .cse5 4) 0) .cse7))) (and .cse0 .cse8 .cse3 .cse4 (exists ((v_arrayElimCell_18 Int)) (let ((.cse9 (select |#memory_$Pointer$.base| v_arrayElimCell_18))) (let ((.cse10 (select .cse9 4)) (.cse11 (select |#memory_$Pointer$.offset| v_arrayElimCell_18))) (and (= (select .cse9 0) .cse10) (not (= |main_~#s~0.base| .cse10)) (= (select (select |#memory_$Pointer$.offset| .cse10) 4) 0) (= (select .cse11 0) 0) (not (= .cse10 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| .cse10) 4) .cse10) (= .cse10 .cse1) (= (select .cse11 4) 0))))) .cse7) (and .cse0 .cse8 (<= 2 |main_~#s~0.base|) .cse3 .cse4 (= .cse1 0)) (<= |#StackHeapBarrier| 0))) [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point L619-1(lines 618 620) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 613 627) the Hoare annotation is: (or (<= |#StackHeapBarrier| 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 01:05:14,925 INFO L895 garLoopResultBuilder]: At program point L616(line 616) the Hoare annotation is: (or (and (= |main_~#s~0.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= main_~len~0 2) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= (select |#valid| |main_~#s~0.base|) 1)) (<= |#StackHeapBarrier| 0)) [2023-04-02 01:05:14,925 INFO L895 garLoopResultBuilder]: At program point L618-2(lines 618 620) the Hoare annotation is: (let ((.cse7 (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|)) (.cse0 (= |main_~#s~0.offset| 0)) (.cse3 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 0)) (.cse4 (= main_~len~0 2)) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0))) (or (let ((.cse6 (select (select |#memory_$Pointer$.base| .cse1) 4))) (let ((.cse2 (select |#memory_$Pointer$.base| .cse6)) (.cse5 (select |#memory_$Pointer$.offset| .cse6))) (and .cse0 (not (= |main_~#s~0.base| .cse1)) (= (select .cse2 4) .cse1) (= (select .cse2 0) .cse1) .cse3 .cse4 (= (select .cse5 0) 0) (= main_~i~0 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (not (= .cse6 .cse1)) (= (select .cse5 4) 0) .cse7))) (and .cse0 (<= main_~i~0 1) .cse3 .cse4 (exists ((v_arrayElimCell_18 Int)) (let ((.cse8 (select |#memory_$Pointer$.base| v_arrayElimCell_18))) (let ((.cse9 (select .cse8 4)) (.cse10 (select |#memory_$Pointer$.offset| v_arrayElimCell_18))) (and (= (select .cse8 0) .cse9) (not (= |main_~#s~0.base| .cse9)) (= (select (select |#memory_$Pointer$.offset| .cse9) 4) 0) (= (select .cse10 0) 0) (not (= .cse9 v_arrayElimCell_18)) (= (select (select |#memory_$Pointer$.base| .cse9) 4) .cse9) (= .cse9 .cse1) (= (select .cse10 4) 0))))) .cse7) (<= |#StackHeapBarrier| 0) (and .cse0 (<= 2 |main_~#s~0.base|) .cse3 .cse4 (= .cse1 0)))) [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point L618-3(lines 618 620) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point L603(lines 603 611) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 601 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)|) (= |old(#valid)| |#valid|)) (<= |#StackHeapBarrier| 0)) [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point L603-2(lines 601 612) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point dll_circular_remove_lastEXIT(lines 601 612) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point __bswap_64FINAL(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point __bswap_64EXIT(lines 79 83) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 01:05:14,925 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2023-04-02 01:05:14,925 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 01:05:14,926 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 01:05:14,928 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2023-04-02 01:05:14,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:05:14,936 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,937 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,952 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,954 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,955 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,958 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,961 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:05:14 BoogieIcfgContainer [2023-04-02 01:05:14,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:05:14,964 INFO L158 Benchmark]: Toolchain (without parser) took 37807.22ms. Allocated memory was 185.6MB in the beginning and 521.1MB in the end (delta: 335.5MB). Free memory was 138.5MB in the beginning and 198.9MB in the end (delta: -60.4MB). Peak memory consumption was 276.2MB. Max. memory is 8.0GB. [2023-04-02 01:05:14,964 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:05:14,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.72ms. Allocated memory is still 185.6MB. Free memory was 138.1MB in the beginning and 121.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-02 01:05:14,964 INFO L158 Benchmark]: Boogie Preprocessor took 38.58ms. Allocated memory is still 185.6MB. Free memory was 121.0MB in the beginning and 118.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-02 01:05:14,964 INFO L158 Benchmark]: RCFGBuilder took 436.17ms. Allocated memory is still 185.6MB. Free memory was 118.2MB in the beginning and 95.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-04-02 01:05:14,965 INFO L158 Benchmark]: TraceAbstraction took 37046.19ms. Allocated memory was 185.6MB in the beginning and 521.1MB in the end (delta: 335.5MB). Free memory was 94.5MB in the beginning and 198.9MB in the end (delta: -104.4MB). Peak memory consumption was 232.2MB. Max. memory is 8.0GB. [2023-04-02 01:05:14,965 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 185.6MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.72ms. Allocated memory is still 185.6MB. Free memory was 138.1MB in the beginning and 121.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.58ms. Allocated memory is still 185.6MB. Free memory was 121.0MB in the beginning and 118.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 436.17ms. Allocated memory is still 185.6MB. Free memory was 118.2MB in the beginning and 95.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 37046.19ms. Allocated memory was 185.6MB in the beginning and 521.1MB in the end (delta: 335.5MB). Free memory was 94.5MB in the beginning and 198.9MB in the end (delta: -104.4MB). Peak memory consumption was 232.2MB. 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$.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$.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$.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$.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$.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$.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$.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$.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_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,QUANTIFIED] - 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_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] - 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$.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$.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$.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$.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$.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_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,QUANTIFIED] - 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_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,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_arrayElimCell_18,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_arrayElimCell_18,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] - 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 * 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: 625]: 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 10 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 113 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2970 IncrementalHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 55 mSDtfsCounter, 2970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 175 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 25.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 33 PreInvPairs, 47 NumberOfFragments, 799 HoareAnnotationTreeSize, 33 FomulaSimplifications, 854 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 443 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 29.7s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 746 ConstructedInterpolants, 9 QuantifiedInterpolants, 6066 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2184 ConjunctsInSsa, 245 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 186/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 588]: Loop Invariant [2023-04-02 01:05:14,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,971 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((head == last && len == \old(len)) && #memory_$Pointer$[head][4] == 0) && head == 0) && \old(\valid)[head := 1] == \valid) && last == 0) && !(head == 0)) && #memory_$Pointer$[head][0] == 0) || (((((((((len <= 1 && new_head == 0) && head + 1 <= unknown-#StackHeapBarrier-unknown) && head == 0) && last == 0) && #memory_$Pointer$[last][4] == 0) && \old(\valid)[last := 1][head] == 0) && new_head == #memory_$Pointer$[last][4]) && head == #memory_$Pointer$[last][4]) && #memory_$Pointer$[last][0] == 0)) || 3 <= \old(len)) || unknown-#StackHeapBarrier-unknown <= 0 - InvariantResult [Line: 618]: Loop Invariant [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,972 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,973 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,975 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,976 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,977 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_18,QUANTIFIED] [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2023-04-02 01:05:14,979 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((s == 0 && !(s == #memory_$Pointer$[s][0])) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][0]][4]][4] == #memory_$Pointer$[s][0]) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][0]][4]][0] == #memory_$Pointer$[s][0]) && #memory_$Pointer$[s][0] == 0) && len == 2) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][0]][4]][0] == 0) && i == 0) && #memory_$Pointer$[#memory_$Pointer$[s][0]][4] == 0) && !(#memory_$Pointer$[#memory_$Pointer$[s][0]][4] == #memory_$Pointer$[s][0])) && #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][0]][4]][4] == 0) && unknown-#StackHeapBarrier-unknown + 1 <= s) || (((((s == 0 && i <= 1) && #memory_$Pointer$[s][0] == 0) && len == 2) && (\exists v_arrayElimCell_18 : int :: ((((((#memory_$Pointer$[v_arrayElimCell_18][0] == #memory_$Pointer$[v_arrayElimCell_18][4] && !(s == #memory_$Pointer$[v_arrayElimCell_18][4])) && #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_18][4]][4] == 0) && #memory_$Pointer$[v_arrayElimCell_18][0] == 0) && !(#memory_$Pointer$[v_arrayElimCell_18][4] == v_arrayElimCell_18)) && #memory_$Pointer$[#memory_$Pointer$[v_arrayElimCell_18][4]][4] == #memory_$Pointer$[v_arrayElimCell_18][4]) && #memory_$Pointer$[v_arrayElimCell_18][4] == #memory_$Pointer$[s][0]) && #memory_$Pointer$[v_arrayElimCell_18][4] == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= s)) || unknown-#StackHeapBarrier-unknown <= 0) || ((((s == 0 && 2 <= s) && #memory_$Pointer$[s][0] == 0) && len == 2) && #memory_$Pointer$[s][0] == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: unknown-#StackHeapBarrier-unknown <= 0 - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-04-02 01:05:15,001 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...