/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_append_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:49:17,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:49:17,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:49:17,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:49:17,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:49:17,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:49:17,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:49:17,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:49:17,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:49:17,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:49:17,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:49:17,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:49:17,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:49:17,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:49:17,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:49:17,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:49:17,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:49:17,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:49:17,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:49:17,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:49:17,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:49:17,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:49:17,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:49:17,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:49:18,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:49:18,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:49:18,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:49:18,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:49:18,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:49:18,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:49:18,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:49:18,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:49:18,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:49:18,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:49:18,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:49:18,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:49:18,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:49:18,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:49:18,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:49:18,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:49:18,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:49:18,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:49:18,025 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:49:18,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:49:18,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:49:18,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:49:18,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:49:18,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:49:18,026 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:49:18,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:49:18,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:49:18,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:49:18,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:49:18,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:49:18,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:49:18,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:49:18,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:49:18,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:49:18,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:49:18,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:49:18,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:49:18,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:49:18,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:49:18,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:49:18,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:49:18,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:49:18,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:49:18,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:49:18,031 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:49:18,031 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:49:18,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:49:18,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:49:18,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:49:18,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:49:18,264 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:49:18,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_append_unequal.i [2022-01-10 17:49:18,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c830c97d9/1f42c177f94a4b8fa5be1b092d491ff0/FLAG2b7b36386 [2022-01-10 17:49:18,704 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:49:18,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.i [2022-01-10 17:49:18,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c830c97d9/1f42c177f94a4b8fa5be1b092d491ff0/FLAG2b7b36386 [2022-01-10 17:49:18,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c830c97d9/1f42c177f94a4b8fa5be1b092d491ff0 [2022-01-10 17:49:18,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:49:18,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:49:18,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:49:18,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:49:18,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:49:18,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:49:18" (1/1) ... [2022-01-10 17:49:18,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730e0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:18, skipping insertion in model container [2022-01-10 17:49:18,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:49:18" (1/1) ... [2022-01-10 17:49:18,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:49:18,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:49:19,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.i[24587,24600] [2022-01-10 17:49:19,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:49:19,055 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:49:19,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_append_unequal.i[24587,24600] [2022-01-10 17:49:19,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:49:19,116 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:49:19,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19 WrapperNode [2022-01-10 17:49:19,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:49:19,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:49:19,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:49:19,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:49:19,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,150 INFO L137 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 185 [2022-01-10 17:49:19,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:49:19,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:49:19,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:49:19,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:49:19,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:49:19,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:49:19,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:49:19,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:49:19,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:49:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:19,200 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) [2022-01-10 17:49:19,204 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 [2022-01-10 17:49:19,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:49:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:49:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 17:49:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:49:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:49:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:49:19,323 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:49:19,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:49:19,591 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:49:19,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:49:19,595 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 17:49:19,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:19 BoogieIcfgContainer [2022-01-10 17:49:19,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:49:19,597 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:49:19,597 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:49:19,598 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:49:19,600 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:19" (1/1) ... [2022-01-10 17:49:19,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:49:19 BasicIcfg [2022-01-10 17:49:19,680 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:49:19,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:49:19,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:49:19,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:49:19,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:49:18" (1/4) ... [2022-01-10 17:49:19,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784bac61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:49:19, skipping insertion in model container [2022-01-10 17:49:19,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:49:19" (2/4) ... [2022-01-10 17:49:19,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784bac61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:49:19, skipping insertion in model container [2022-01-10 17:49:19,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:49:19" (3/4) ... [2022-01-10 17:49:19,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784bac61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:49:19, skipping insertion in model container [2022-01-10 17:49:19,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:49:19" (4/4) ... [2022-01-10 17:49:19,688 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.iTransformedIcfg [2022-01-10 17:49:19,692 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:49:19,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:49:19,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:49:19,725 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:49:19,725 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:49:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 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) [2022-01-10 17:49:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:49:19,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:19,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:19,737 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 197008479, now seen corresponding path program 1 times [2022-01-10 17:49:19,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828271288] [2022-01-10 17:49:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:19,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:19,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:19,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828271288] [2022-01-10 17:49:19,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828271288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:19,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:19,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:49:19,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114155548] [2022-01-10 17:49:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:19,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:49:19,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:49:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:49:19,974 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2022-01-10 17:49:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:19,990 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-01-10 17:49:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:49:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) Word has length 17 [2022-01-10 17:49:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:19,998 INFO L225 Difference]: With dead ends: 67 [2022-01-10 17:49:19,998 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 17:49:20,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:49:20,009 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:20,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 17:49:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 17:49:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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) [2022-01-10 17:49:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-01-10 17:49:20,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2022-01-10 17:49:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:20,038 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-01-10 17:49:20,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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) [2022-01-10 17:49:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-01-10 17:49:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:49:20,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:20,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:20,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:49:20,041 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1519871890, now seen corresponding path program 1 times [2022-01-10 17:49:20,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:20,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77009664] [2022-01-10 17:49:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:20,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:20,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77009664] [2022-01-10 17:49:20,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77009664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:20,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:20,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 17:49:20,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291159547] [2022-01-10 17:49:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:20,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 17:49:20,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 17:49:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:49:20,457 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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) [2022-01-10 17:49:20,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:20,682 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-01-10 17:49:20,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:49:20,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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) Word has length 18 [2022-01-10 17:49:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:20,687 INFO L225 Difference]: With dead ends: 40 [2022-01-10 17:49:20,687 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 17:49:20,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-01-10 17:49:20,689 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:20,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 56 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:49:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 17:49:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 17:49:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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) [2022-01-10 17:49:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 17:49:20,694 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2022-01-10 17:49:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:20,694 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 17:49:20,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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) [2022-01-10 17:49:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 17:49:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:49:20,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:20,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:20,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:49:20,695 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 253487291, now seen corresponding path program 1 times [2022-01-10 17:49:20,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:20,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964701155] [2022-01-10 17:49:20,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:20,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:20,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:20,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964701155] [2022-01-10 17:49:20,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964701155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:49:20,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:49:20,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:49:20,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303073569] [2022-01-10 17:49:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:49:20,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:49:20,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:49:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:49:20,830 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-01-10 17:49:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:20,845 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-01-10 17:49:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:49:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2022-01-10 17:49:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:20,846 INFO L225 Difference]: With dead ends: 50 [2022-01-10 17:49:20,846 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 17:49:20,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:49:20,851 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:20,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 17:49:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 17:49:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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) [2022-01-10 17:49:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 17:49:20,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2022-01-10 17:49:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:20,861 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 17:49:20,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-01-10 17:49:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 17:49:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:49:20,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:20,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:20,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:49:20,863 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:20,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 764055361, now seen corresponding path program 1 times [2022-01-10 17:49:20,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:20,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131870310] [2022-01-10 17:49:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:20,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:21,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:21,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131870310] [2022-01-10 17:49:21,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131870310] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:21,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119482534] [2022-01-10 17:49:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:21,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:21,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:21,712 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) [2022-01-10 17:49:21,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:49:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:21,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-10 17:49:21,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:21,955 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:49:21,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-10 17:49:22,017 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:49:22,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 17:49:22,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:49:22,277 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:49:22,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 17:49:22,383 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-01-10 17:49:22,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 17:49:22,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:22,504 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:49:22,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 60 treesize of output 56 [2022-01-10 17:49:22,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:22,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 53 [2022-01-10 17:49:22,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:22,899 INFO L353 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-01-10 17:49:22,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 64 [2022-01-10 17:49:22,918 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 17:49:22,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 85 [2022-01-10 17:49:22,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:22,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:22,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2022-01-10 17:49:23,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2022-01-10 17:49:23,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:23,113 INFO L353 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2022-01-10 17:49:23,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 36 [2022-01-10 17:49:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:23,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:23,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.offsetInt|))) (let ((.cse1 (select |c_#memory_$Pointer$.baseInt| .cse0))) (or (not (= .cse0 (select .cse1 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt|))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| .cse0 (store .cse1 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~new_last~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~new_last~0#1.baseInt| v_ArrVal_318))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse2 .cse3) (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse0 v_ArrVal_320) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~new_last~0#1.baseInt| v_ArrVal_314) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse3)))))))) is different from false [2022-01-10 17:49:23,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.offsetInt|))) (let ((.cse1 (select |c_#memory_$Pointer$.baseInt| .cse0))) (or (not (= .cse0 (select .cse1 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt|))) (not (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| .cse0 (store .cse1 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_318))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse2 .cse3) (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse0 v_ArrVal_320) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_314) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse3)))))))) is different from false [2022-01-10 17:49:23,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| Int) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_312))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_append_~head#1.offsetInt|))) (let ((.cse4 (select .cse3 .cse2))) (or (not (let ((.cse0 (store (store .cse3 .cse2 (store .cse4 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_318))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_313) .cse2 v_ArrVal_320) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_314) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse1)))) (not (= .cse2 (select .cse4 |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt|)))))))) is different from false [2022-01-10 17:49:23,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 997 treesize of output 989 [2022-01-10 17:49:23,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 984 treesize of output 976 [2022-01-10 17:49:23,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 976 treesize of output 972 [2022-01-10 17:49:23,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 972 treesize of output 970 [2022-01-10 17:49:26,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| Int) (|ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_311))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_312))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1|) 0)) (not (= .cse0 (select (select .cse1 .cse0) |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt|))) (not (< |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| |c_#StackHeapBarrierInt|)) (not (= (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.baseInt|)) (let ((.cse8 (= |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| .cse0))) (let ((.cse3 (= |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1|)) (.cse9 (not .cse8))) (and (or .cse3 (and (or (forall ((v_ArrVal_318 (Array Int Int))) (not (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_311) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_312))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (store .cse6 .cse7 (store (select .cse6 .cse7) |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1|)))) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_318))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse4 .cse5) |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~head~0#1.offsetInt|) .cse5))))) .cse8) (or .cse9 (forall ((v_ArrVal_318 (Array Int Int)) (v_arrayElimCell_22 Int)) (not (let ((.cse10 (store (let ((.cse12 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_311) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_312))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (store .cse12 .cse13 (store (select .cse12 .cse13) |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1|)))) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_318))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse10 .cse11) v_arrayElimCell_22) .cse11)))))))) (or (not .cse3) (let ((.cse14 (forall ((v_ArrVal_318 (Array Int Int)) (v_arrayElimCell_21 Int)) (not (let ((.cse15 (store (let ((.cse17 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_circular_create_~last~0#1.baseInt| v_ArrVal_311) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_312))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (store .cse17 .cse18 (store (select .cse17 .cse18) |ULTIMATE.start_ULTIMATE.start_sll_circular_append_~last~1#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1|)))) |v_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt_1| v_ArrVal_318))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (= (select (select .cse15 .cse16) v_arrayElimCell_21) .cse16))))))) (and (or .cse9 .cse14) (or .cse8 .cse14)))))))))))) is different from false [2022-01-10 17:49:28,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:28,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1144 treesize of output 704 [2022-01-10 17:49:39,927 WARN L228 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 404 DAG size of output: 272 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-10 17:49:39,928 INFO L353 Elim1Store]: treesize reduction 410, result has 59.6 percent of original size [2022-01-10 17:49:39,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 18 new quantified variables, introduced 91 case distinctions, treesize of input 101100871 treesize of output 95700388