/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_NONE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:37:51,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:37:51,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:37:51,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:37:51,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:37:51,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:37:51,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:37:51,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:37:51,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:37:51,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:37:51,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:37:51,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:37:51,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:37:51,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:37:51,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:37:51,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:37:51,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:37:51,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:37:51,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:37:51,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:37:51,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:37:51,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:37:51,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:37:51,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:37:51,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:37:51,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:37:51,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:37:51,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:37:51,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:37:51,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:37:51,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:37:51,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:37:51,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:37:51,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:37:51,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:37:51,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:37:51,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:37:51,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:37:51,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:37:51,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:37:51,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:37:51,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:37:51,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:37:51,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:37:51,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:37:51,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:37:51,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:37:51,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:37:51,901 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:37:51,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:37:51,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:37:51,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:37:51,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:37:51,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:37:51,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:51,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:37:51,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:37:51,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:37:51,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:37:51,906 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:37:51,907 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 23:37:52,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:37:52,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:37:52,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:37:52,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:37:52,152 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:37:52,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-10 23:37:52,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ddd1b6e/022e3b98cdf24de98ea32a2426a3e824/FLAG192d237c2 [2022-01-10 23:37:52,589 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:37:52,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-10 23:37:52,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ddd1b6e/022e3b98cdf24de98ea32a2426a3e824/FLAG192d237c2 [2022-01-10 23:37:52,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ddd1b6e/022e3b98cdf24de98ea32a2426a3e824 [2022-01-10 23:37:52,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:37:52,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:37:52,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:52,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:37:52,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:37:52,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:52,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f10aa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52, skipping insertion in model container [2022-01-10 23:37:52,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:52,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:37:52,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:37:52,883 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/dll2c_update_all_reverse.i[24556,24569] [2022-01-10 23:37:52,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:52,907 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:37:52,950 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/dll2c_update_all_reverse.i[24556,24569] [2022-01-10 23:37:52,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:52,975 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:37:52,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52 WrapperNode [2022-01-10 23:37:52,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:52,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:52,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:37:52,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:37:52,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,022 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 145 [2022-01-10 23:37:53,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:53,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:37:53,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:37:53,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:37:53,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:37:53,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:37:53,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:37:53,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:37:53,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (1/1) ... [2022-01-10 23:37:53,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:53,073 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 23:37:53,089 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 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:37:53,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:37:53,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:37:53,246 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:37:53,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:37:53,525 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:37:53,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:37:53,529 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 23:37:53,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:53 BoogieIcfgContainer [2022-01-10 23:37:53,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:37:53,531 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:37:53,531 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:37:53,534 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:37:53,536 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:53" (1/1) ... [2022-01-10 23:37:53,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:53 BasicIcfg [2022-01-10 23:37:53,625 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:37:53,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:37:53,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:37:53,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:37:53,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:37:52" (1/4) ... [2022-01-10 23:37:53,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4fcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:53, skipping insertion in model container [2022-01-10 23:37:53,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:52" (2/4) ... [2022-01-10 23:37:53,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4fcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:53, skipping insertion in model container [2022-01-10 23:37:53,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:53" (3/4) ... [2022-01-10 23:37:53,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb4fcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:37:53, skipping insertion in model container [2022-01-10 23:37:53,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:53" (4/4) ... [2022-01-10 23:37:53,630 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.iTransformedIcfg [2022-01-10 23:37:53,633 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:37:53,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:37:53,678 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:37:53,684 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 23:37:53,684 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:37:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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 23:37:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:37:53,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:53,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:53,699 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash -327494694, now seen corresponding path program 1 times [2022-01-10 23:37:53,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:53,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111326519] [2022-01-10 23:37:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:53,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:53,930 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 23:37:53,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111326519] [2022-01-10 23:37:53,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111326519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:53,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:53,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:37:53,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277441936] [2022-01-10 23:37:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:53,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:37:53,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:37:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:37:53,961 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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.0) internal successors, (16), 2 states have internal predecessors, (16), 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 23:37:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:53,975 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-01-10 23:37:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:37:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2022-01-10 23:37:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:53,982 INFO L225 Difference]: With dead ends: 61 [2022-01-10 23:37:53,982 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 23:37:53,984 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 23:37:53,988 INFO L933 BasicCegarLoop]: 46 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, 46 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 23:37:53,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 23:37:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 23:37:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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 23:37:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-10 23:37:54,018 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-01-10 23:37:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:54,018 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-10 23:37:54,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 23:37:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-10 23:37:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:37:54,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:54,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:54,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:37:54,020 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1416239162, now seen corresponding path program 1 times [2022-01-10 23:37:54,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:54,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700752995] [2022-01-10 23:37:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:54,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:54,160 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 23:37:54,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:54,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700752995] [2022-01-10 23:37:54,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700752995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:54,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:54,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:37:54,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240038714] [2022-01-10 23:37:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:54,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:37:54,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:37:54,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:37:54,165 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:37:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:54,188 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-01-10 23:37:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:37:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-10 23:37:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:54,189 INFO L225 Difference]: With dead ends: 44 [2022-01-10 23:37:54,190 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 23:37:54,195 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 23:37:54,196 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 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 23:37:54,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 23:37:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 23:37:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 23:37:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 23:37:54,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2022-01-10 23:37:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:54,206 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 23:37:54,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:37:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 23:37:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 23:37:54,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:54,207 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] [2022-01-10 23:37:54,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:37:54,207 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1321570061, now seen corresponding path program 1 times [2022-01-10 23:37:54,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410522510] [2022-01-10 23:37:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:54,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:54,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:54,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410522510] [2022-01-10 23:37:54,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410522510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:54,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:54,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:37:54,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701672359] [2022-01-10 23:37:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:54,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:37:54,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:37:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:37:54,448 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 23:37:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:54,551 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-10 23:37:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:37:54,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 23:37:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:54,552 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:37:54,553 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 23:37:54,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:37:54,553 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:54,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:37:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 23:37:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-10 23:37:54,558 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 23:37:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 23:37:54,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2022-01-10 23:37:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:54,559 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 23:37:54,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 23:37:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 23:37:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 23:37:54,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:54,559 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, 1, 1] [2022-01-10 23:37:54,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:37:54,560 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1439046502, now seen corresponding path program 1 times [2022-01-10 23:37:54,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:54,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082210509] [2022-01-10 23:37:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:54,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:54,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:54,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082210509] [2022-01-10 23:37:54,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082210509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:54,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:54,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:37:54,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570326330] [2022-01-10 23:37:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:54,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:37:54,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:37:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:37:54,738 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 23:37:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:54,820 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-01-10 23:37:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:37:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2022-01-10 23:37:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:54,821 INFO L225 Difference]: With dead ends: 56 [2022-01-10 23:37:54,821 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 23:37:54,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:37:54,830 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:54,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 23:37:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-01-10 23:37:54,840 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 23:37:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 23:37:54,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 27 [2022-01-10 23:37:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:54,841 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 23:37:54,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 23:37:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 23:37:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 23:37:54,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:54,842 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, 1, 1, 1] [2022-01-10 23:37:54,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:37:54,842 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:54,842 INFO L85 PathProgramCache]: Analyzing trace with hash -580719043, now seen corresponding path program 1 times [2022-01-10 23:37:54,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:54,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919866684] [2022-01-10 23:37:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:54,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:55,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919866684] [2022-01-10 23:37:55,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919866684] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323207046] [2022-01-10 23:37:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:55,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:55,063 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 23:37:55,098 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 23:37:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:55,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 23:37:55,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:55,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:55,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323207046] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:55,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 23:37:55,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2022-01-10 23:37:55,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504104001] [2022-01-10 23:37:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:55,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:37:55,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:37:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-10 23:37:55,763 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 23:37:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:55,872 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-01-10 23:37:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:37:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-01-10 23:37:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:55,873 INFO L225 Difference]: With dead ends: 51 [2022-01-10 23:37:55,873 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 23:37:55,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-10 23:37:55,874 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 98 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:55,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 75 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:37:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 23:37:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-01-10 23:37:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 23:37:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-01-10 23:37:55,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2022-01-10 23:37:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:55,880 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-01-10 23:37:55,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 23:37:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-01-10 23:37:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 23:37:55,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:55,880 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, 1, 1, 1, 1] [2022-01-10 23:37:55,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 23:37:56,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:56,097 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -798591139, now seen corresponding path program 1 times [2022-01-10 23:37:56,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:56,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201739221] [2022-01-10 23:37:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:56,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:37:56,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:56,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201739221] [2022-01-10 23:37:56,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201739221] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:56,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512278337] [2022-01-10 23:37:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:56,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:56,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:56,220 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) [2022-01-10 23:37:56,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 23:37:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:56,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 103 conjunts are in the unsatisfiable core [2022-01-10 23:37:56,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:56,383 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:37:56,472 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:37:56,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 23:37:56,560 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 23:37:56,569 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 23:37:56,622 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:37:56,622 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 36 treesize of output 35 [2022-01-10 23:37:56,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-01-10 23:37:56,738 INFO L353 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-01-10 23:37:56,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 91 [2022-01-10 23:37:56,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:56,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 75 treesize of output 67 [2022-01-10 23:37:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:56,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 32 [2022-01-10 23:37:56,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:56,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 25 [2022-01-10 23:37:56,765 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 0 case distinctions, treesize of input 20 treesize of output 19 [2022-01-10 23:37:56,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 27 [2022-01-10 23:37:56,780 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 17 treesize of output 11 [2022-01-10 23:37:57,006 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:37:57,006 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 64 treesize of output 61 [2022-01-10 23:37:57,010 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 35 treesize of output 27 [2022-01-10 23:37:57,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 50 [2022-01-10 23:37:57,243 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 35 treesize of output 23 [2022-01-10 23:37:57,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 21 [2022-01-10 23:37:57,287 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 23 treesize of output 7 [2022-01-10 23:37:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:57,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:57,474 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 106 treesize of output 84 [2022-01-10 23:37:57,501 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_471 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616)))) is different from false [2022-01-10 23:37:57,556 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) 18446744073709551616) (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616)))) is different from false [2022-01-10 23:37:57,581 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296)) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)))) is different from false [2022-01-10 23:37:57,590 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) 18446744073709551616))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))))) is different from false [2022-01-10 23:37:57,616 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse1 v_ArrVal_468))) (= (mod (+ 16 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse1 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) 18446744073709551616))))) (forall ((v_ArrVal_465 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse3) .cse2 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))))) is different from false [2022-01-10 23:37:57,647 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_465 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse0) .cse1 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse3 v_ArrVal_468))) (= (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse2) (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse3 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 16) 18446744073709551616)))))) is different from false [2022-01-10 23:37:57,667 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_460)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse1 (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse2 v_ArrVal_468))) (= (mod (+ 16 (select (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) (select (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_461) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse2 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) 18446744073709551616))))) (forall ((v_ArrVal_465 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_461))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse4) .cse5 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse5)))))) is different from false [2022-01-10 23:37:57,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:57,687 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 100 treesize of output 77 [2022-01-10 23:37:57,689 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 418 treesize of output 404 [2022-01-10 23:37:57,695 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 360 treesize of output 350 [2022-01-10 23:37:57,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:57,704 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 145 treesize of output 137 [2022-01-10 23:37:57,707 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 430 treesize of output 414 [2022-01-10 23:37:57,710 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 414 treesize of output 386 [2022-01-10 23:37:57,895 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:37:57,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2022-01-10 23:37:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 23:37:58,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512278337] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:58,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:58,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20, 20] total 41 [2022-01-10 23:37:58,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927925261] [2022-01-10 23:37:58,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:58,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-10 23:37:58,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-10 23:37:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1031, Unknown=7, NotChecked=490, Total=1640 [2022-01-10 23:37:58,030 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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 23:38:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:00,086 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-01-10 23:38:00,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 23:38:00,086 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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 29 [2022-01-10 23:38:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:00,087 INFO L225 Difference]: With dead ends: 95 [2022-01-10 23:38:00,087 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 23:38:00,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=2097, Unknown=7, NotChecked=700, Total=3080 [2022-01-10 23:38:00,089 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 143 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:00,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 318 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 629 Invalid, 0 Unknown, 349 Unchecked, 0.7s Time] [2022-01-10 23:38:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 23:38:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 37. [2022-01-10 23:38:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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 23:38:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-01-10 23:38:00,102 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 29 [2022-01-10 23:38:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:00,102 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-01-10 23:38:00,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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 23:38:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-01-10 23:38:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 23:38:00,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:00,103 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 23:38:00,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 23:38:00,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 23:38:00,319 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:00,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1584629712, now seen corresponding path program 2 times [2022-01-10 23:38:00,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:00,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072698807] [2022-01-10 23:38:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:00,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:38:01,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072698807] [2022-01-10 23:38:01,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072698807] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120124430] [2022-01-10 23:38:01,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:38:01,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:01,532 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) [2022-01-10 23:38:01,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 23:38:02,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:38:02,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:02,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-10 23:38:02,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:02,041 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:38:02,157 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:38:02,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 23:38:02,259 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 23:38:02,311 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:02,311 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 26 treesize of output 27 [2022-01-10 23:38:02,436 INFO L353 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-01-10 23:38:02,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 70 [2022-01-10 23:38:02,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:02,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 58 [2022-01-10 23:38:02,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-01-10 23:38:02,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 23 [2022-01-10 23:38:02,467 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 13 treesize of output 7 [2022-01-10 23:38:02,787 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:02,787 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 79 treesize of output 72 [2022-01-10 23:38:02,792 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 35 treesize of output 27 [2022-01-10 23:38:02,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 40 [2022-01-10 23:38:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:03,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:03,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-01-10 23:38:03,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 36 [2022-01-10 23:38:03,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:03,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 42 [2022-01-10 23:38:03,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:03,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 50 treesize of output 26 [2022-01-10 23:38:03,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2022-01-10 23:38:03,337 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 23 treesize of output 7 [2022-01-10 23:38:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:38:03,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:03,696 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse0 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_630) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_634)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_633)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 (* (div (+ .cse1 16) 18446744073709551616) (- 18446744073709551616)) 16)))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (let ((.cse2 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_630) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse2 v_ArrVal_634)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse2 v_ArrVal_633)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse3 (* (div (+ .cse3 16) 18446744073709551616) (- 18446744073709551616)) 16)))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296)))) is different from false [2022-01-10 23:38:03,749 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_630) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse1 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse1) 18446744073709551616) (- 18446744073709551616)) .cse1)))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_630) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2 v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse3 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2 v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse3) 18446744073709551616) (- 18446744073709551616)) .cse3))))))) is different from false [2022-01-10 23:38:03,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:03,773 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 81 treesize of output 82 [2022-01-10 23:38:03,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:03,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 169 [2022-01-10 23:38:03,787 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 68 treesize of output 29 [2022-01-10 23:38:03,854 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:03,854 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 81 treesize of output 82 [2022-01-10 23:38:03,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:03,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 169 [2022-01-10 23:38:03,870 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 68 treesize of output 29 [2022-01-10 23:38:03,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse0) (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_634 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_628) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_634 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_628) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_633 Int)) (= (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_626) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 16 (* (div (+ .cse1 16) 18446744073709551616) (- 18446744073709551616)))))))) is different from false [2022-01-10 23:38:03,965 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:03,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2022-01-10 23:38:03,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:03,970 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 30 treesize of output 26 [2022-01-10 23:38:03,986 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 58 treesize of output 54 [2022-01-10 23:38:04,048 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 23:38:04,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 53 [2022-01-10 23:38:04,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))) is different from false [2022-01-10 23:38:04,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) is different from false [2022-01-10 23:38:04,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_621) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) is different from false [2022-01-10 23:38:04,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:04,288 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 29 treesize of output 30 [2022-01-10 23:38:04,289 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 187 treesize of output 181 [2022-01-10 23:38:04,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:04,293 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 160 treesize of output 156 [2022-01-10 23:38:04,295 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 193 treesize of output 187 [2022-01-10 23:38:04,302 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 28 treesize of output 26 [2022-01-10 23:38:04,309 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 28 treesize of output 26 [2022-01-10 23:38:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-10 23:38:04,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120124430] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:04,535 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:04,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 59 [2022-01-10 23:38:04,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117116281] [2022-01-10 23:38:04,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:04,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-10 23:38:04,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-10 23:38:04,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2615, Unknown=6, NotChecked=642, Total=3422 [2022-01-10 23:38:04,537 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 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 23:38:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:08,568 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-01-10 23:38:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-10 23:38:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 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 34 [2022-01-10 23:38:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:08,574 INFO L225 Difference]: With dead ends: 88 [2022-01-10 23:38:08,574 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 23:38:08,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=523, Invalid=4897, Unknown=6, NotChecked=894, Total=6320 [2022-01-10 23:38:08,576 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 217 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:08,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 378 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1021 Invalid, 0 Unknown, 340 Unchecked, 1.0s Time] [2022-01-10 23:38:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 23:38:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2022-01-10 23:38:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 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 23:38:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-01-10 23:38:08,603 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 34 [2022-01-10 23:38:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:08,604 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-01-10 23:38:08,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 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 23:38:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-01-10 23:38:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 23:38:08,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:08,608 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 23:38:08,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:08,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:08,816 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1902710826, now seen corresponding path program 3 times [2022-01-10 23:38:08,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:08,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195363320] [2022-01-10 23:38:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:08,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:08,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:08,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195363320] [2022-01-10 23:38:08,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195363320] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:08,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350230377] [2022-01-10 23:38:08,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 23:38:08,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:08,925 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) [2022-01-10 23:38:08,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 23:38:12,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 23:38:12,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:12,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 23:38:12,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:12,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:12,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350230377] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:12,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 23:38:12,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-01-10 23:38:12,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476964482] [2022-01-10 23:38:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:12,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:38:12,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:12,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:38:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:38:12,969 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 23:38:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:12,990 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-01-10 23:38:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:38:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 35 [2022-01-10 23:38:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:12,991 INFO L225 Difference]: With dead ends: 73 [2022-01-10 23:38:12,991 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 23:38:12,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:38:12,992 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:12,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-01-10 23:38:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 23:38:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-10 23:38:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 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 23:38:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-01-10 23:38:13,049 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2022-01-10 23:38:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:13,050 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-01-10 23:38:13,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 23:38:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-01-10 23:38:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 23:38:13,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:13,051 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 23:38:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:13,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:13,259 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:13,260 INFO L85 PathProgramCache]: Analyzing trace with hash 285778477, now seen corresponding path program 4 times [2022-01-10 23:38:13,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468862952] [2022-01-10 23:38:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:13,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:38:13,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468862952] [2022-01-10 23:38:13,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468862952] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895350299] [2022-01-10 23:38:13,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 23:38:13,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:13,385 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) [2022-01-10 23:38:13,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 23:38:13,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 23:38:13,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:13,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 23:38:13,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:14,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:14,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895350299] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:14,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:14,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 16 [2022-01-10 23:38:14,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697847132] [2022-01-10 23:38:14,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:14,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 23:38:14,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 23:38:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-10 23:38:14,736 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 23:38:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:15,256 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-01-10 23:38:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:38:15,257 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 35 [2022-01-10 23:38:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:15,257 INFO L225 Difference]: With dead ends: 94 [2022-01-10 23:38:15,257 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 23:38:15,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-10 23:38:15,259 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 147 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:15,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 189 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:38:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 23:38:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-01-10 23:38:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 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 23:38:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-01-10 23:38:15,280 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 35 [2022-01-10 23:38:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:15,282 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-01-10 23:38:15,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 23:38:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-01-10 23:38:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:38:15,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:15,284 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 23:38:15,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:15,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:15,489 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -743822241, now seen corresponding path program 1 times [2022-01-10 23:38:15,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314165124] [2022-01-10 23:38:15,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:15,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:16,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314165124] [2022-01-10 23:38:16,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314165124] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681606092] [2022-01-10 23:38:16,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:16,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:16,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:16,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 23:38:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:16,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-10 23:38:16,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:17,258 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-01-10 23:38:18,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:18,255 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:18,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-10 23:38:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:38:19,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:19,956 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 58 [2022-01-10 23:38:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 23:38:20,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681606092] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:20,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:20,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 11] total 37 [2022-01-10 23:38:20,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031903116] [2022-01-10 23:38:20,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:20,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 23:38:20,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:20,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 23:38:20,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 23:38:20,484 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 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 23:38:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:25,979 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-01-10 23:38:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 23:38:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 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 40 [2022-01-10 23:38:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:25,981 INFO L225 Difference]: With dead ends: 124 [2022-01-10 23:38:25,981 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 23:38:25,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=468, Invalid=2611, Unknown=1, NotChecked=0, Total=3080 [2022-01-10 23:38:25,982 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 221 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:25,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 245 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 500 Invalid, 0 Unknown, 38 Unchecked, 1.1s Time] [2022-01-10 23:38:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 23:38:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-01-10 23:38:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 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 23:38:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-01-10 23:38:26,030 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 40 [2022-01-10 23:38:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:26,030 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-01-10 23:38:26,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 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 23:38:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-01-10 23:38:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:38:26,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:26,030 INFO L514 BasicCegarLoop]: 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] [2022-01-10 23:38:26,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:26,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:26,254 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1534324765, now seen corresponding path program 5 times [2022-01-10 23:38:26,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:26,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361449365] [2022-01-10 23:38:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:26,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 23:38:26,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361449365] [2022-01-10 23:38:26,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361449365] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640177165] [2022-01-10 23:38:26,356 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 23:38:26,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:26,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:26,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 23:38:28,677 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-10 23:38:28,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:28,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 145 conjunts are in the unsatisfiable core [2022-01-10 23:38:28,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:28,788 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:38:28,855 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:28,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-01-10 23:38:29,045 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-10 23:38:29,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 23:38:29,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 23:38:29,173 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:29,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 23:38:29,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 24 [2022-01-10 23:38:29,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-01-10 23:38:29,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-01-10 23:38:29,525 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:38:29,526 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 76 treesize of output 71 [2022-01-10 23:38:29,530 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 35 treesize of output 27 [2022-01-10 23:38:29,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 40 [2022-01-10 23:38:29,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2022-01-10 23:38:29,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 36 [2022-01-10 23:38:29,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 42 [2022-01-10 23:38:29,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:38:29,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 27 [2022-01-10 23:38:29,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2022-01-10 23:38:30,057 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 23 treesize of output 7 [2022-01-10 23:38:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:38:30,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:30,453 WARN L838 $PredicateComparison]: unable to prove that (or (not (< (+ (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (forall ((v_ArrVal_1289 Int) (v_ArrVal_1291 Int) (v_ArrVal_1292 (Array Int Int))) (= (let ((.cse0 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1292) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_1289)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_1291)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296)))) is different from false [2022-01-10 23:38:30,477 WARN L838 $PredicateComparison]: unable to prove that (or (not (< (+ (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (forall ((v_ArrVal_1289 Int) (v_ArrVal_1291 Int) (v_ArrVal_1292 (Array Int Int))) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_1292) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_1291) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616)))))) is different from false [2022-01-10 23:38:30,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:30,541 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 62 treesize of output 63 [2022-01-10 23:38:30,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:30,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 131 [2022-01-10 23:38:30,583 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 49 treesize of output 29 [2022-01-10 23:38:30,692 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) (or (not (< (+ .cse0 (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (not (< |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| 4294967296)) (and (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1291 Int)) (= (mod (+ 16 (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1286) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1291) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| .cse0) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))) (not (<= 0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|)))) is different from false [2022-01-10 23:38:31,336 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse0))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|)))) (not (< (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2)))) is different from false [2022-01-10 23:38:31,365 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) v_ArrVal_1287)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= .cse1 (select (store (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse2) .cse1 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-10 23:38:31,403 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse0) .cse1 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse2 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse2) (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_1287)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-10 23:38:31,425 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1276))) (let ((.cse1 (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (store (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse2 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse2))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1276))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse4) (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_1287))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-10 23:38:31,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:38:31,440 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 83 treesize of output 68 [2022-01-10 23:38:31,444 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 300 treesize of output 292 [2022-01-10 23:38:31,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:31,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:31,451 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 229 treesize of output 217 [2022-01-10 23:38:31,466 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 305 treesize of output 297 [2022-01-10 23:38:31,484 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 28 treesize of output 26 [2022-01-10 23:38:31,499 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 28 treesize of output 26 [2022-01-10 23:38:31,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:31,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:38:31,516 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 137 treesize of output 133 [2022-01-10 23:38:31,549 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 23:38:31,549 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-01-10 23:38:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-10 23:38:32,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640177165] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:32,449 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:32,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 26, 27] total 53 [2022-01-10 23:38:32,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108594214] [2022-01-10 23:38:32,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:32,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-10 23:38:32,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-10 23:38:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1937, Unknown=7, NotChecked=658, Total=2756 [2022-01-10 23:38:32,451 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 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 23:38:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:37,552 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-01-10 23:38:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-10 23:38:37,555 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 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 40 [2022-01-10 23:38:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:37,556 INFO L225 Difference]: With dead ends: 117 [2022-01-10 23:38:37,556 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 23:38:37,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=615, Invalid=4808, Unknown=7, NotChecked=1050, Total=6480 [2022-01-10 23:38:37,558 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 152 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:37,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 260 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 712 Invalid, 0 Unknown, 482 Unchecked, 0.9s Time] [2022-01-10 23:38:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 23:38:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-01-10 23:38:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 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 23:38:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-01-10 23:38:37,585 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 40 [2022-01-10 23:38:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:37,585 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-01-10 23:38:37,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 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 23:38:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-01-10 23:38:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:38:37,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:37,586 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:38:37,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:37,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:37,793 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1086042145, now seen corresponding path program 2 times [2022-01-10 23:38:37,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:37,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285446401] [2022-01-10 23:38:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:37,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 23:38:37,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:37,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285446401] [2022-01-10 23:38:37,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285446401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:37,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876904005] [2022-01-10 23:38:37,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:38:37,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:37,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:37,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 23:38:40,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:38:40,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:40,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 23:38:40,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:41,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:38:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:38:43,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876904005] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:38:43,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:38:43,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 26 [2022-01-10 23:38:43,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522181541] [2022-01-10 23:38:43,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:38:43,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 23:38:43,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 23:38:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-01-10 23:38:43,086 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 23:38:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:45,596 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-01-10 23:38:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 23:38:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 42 [2022-01-10 23:38:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:45,597 INFO L225 Difference]: With dead ends: 77 [2022-01-10 23:38:45,597 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 23:38:45,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 23:38:45,598 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 169 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:45,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 308 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 68 Unchecked, 0.5s Time] [2022-01-10 23:38:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 23:38:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-01-10 23:38:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 23:38:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-01-10 23:38:45,618 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2022-01-10 23:38:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:45,619 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-01-10 23:38:45,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 23:38:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-01-10 23:38:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 23:38:45,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:38:45,619 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2022-01-10 23:38:45,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:45,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 23:38:45,826 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:38:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:38:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1836961859, now seen corresponding path program 3 times [2022-01-10 23:38:45,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:38:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318991525] [2022-01-10 23:38:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:38:45,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:38:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:38:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 23:38:45,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:38:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318991525] [2022-01-10 23:38:45,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318991525] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:38:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776797208] [2022-01-10 23:38:45,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 23:38:45,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:38:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:38:46,000 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:38:46,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 23:38:47,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 23:38:47,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:38:47,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 23:38:47,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:38:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 23:38:47,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:38:47,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776797208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:38:47,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:38:47,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-01-10 23:38:47,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936835327] [2022-01-10 23:38:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:38:47,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:38:47,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:38:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:38:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:38:47,315 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 23:38:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:38:47,387 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-01-10 23:38:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:38:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 52 [2022-01-10 23:38:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:38:47,388 INFO L225 Difference]: With dead ends: 53 [2022-01-10 23:38:47,388 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 23:38:47,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:38:47,389 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:38:47,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:38:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 23:38:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 23:38:47,389 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) [2022-01-10 23:38:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 23:38:47,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-01-10 23:38:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:38:47,389 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 23:38:47,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 23:38:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 23:38:47,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 23:38:47,401 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 23:38:47,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 23:38:47,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 23:38:47,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 23:39:02,752 WARN L228 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 308 DAG size of output: 200 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:39:02,755 INFO L861 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:39:02,755 INFO L854 garLoopResultBuilder]: At program point L583(lines 575 584) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) [2022-01-10 23:39:02,755 INFO L854 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse1 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse4 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1)) (.cse6 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 1)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse10 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse7 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (or (let ((.cse3 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) (.cse5 (div (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296))) (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) .cse0 .cse1 .cse2 (= .cse3 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) .cse4 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse3)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| (+ (* .cse5 4294967296) 1)) .cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) (not .cse7) .cse8 .cse9 (<= .cse5 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2147483648)) .cse10 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0)) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) 1) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0))) (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) .cse2 .cse4 .cse6 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) .cse9 .cse10 .cse7))) [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-01-10 23:39:02,755 INFO L858 garLoopResultBuilder]: For program point L577-2(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:39:02,756 INFO L854 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|))) (let ((.cse0 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) (.cse1 (div (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296)) (.cse2 (select .cse3 (mod (+ 8 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) 18446744073709551616)))) (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= .cse0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) 0) 0) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse0)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| (+ (* .cse1 4294967296) 1)) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) (<= .cse1 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2147483648)) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0)) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) 1) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse2)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) (= (select .cse3 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse2) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0)))) [2022-01-10 23:39:02,756 INFO L861 garLoopResultBuilder]: At program point L573-1(line 573) the Hoare annotation is: true [2022-01-10 23:39:02,756 INFO L858 garLoopResultBuilder]: For program point L577-3(lines 577 579) no Hoare annotation was computed. [2022-01-10 23:39:02,756 INFO L854 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse30 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse27 (* 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse26 (+ (select (select |#memory_intInt| (select .cse30 0)) 16) 1)) (.cse14 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) 0)) (.cse21 (div (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) (.cse29 (select .cse30 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (let ((.cse10 (not (= .cse29 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse11 (+ (* .cse21 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) (.cse7 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) (.cse20 (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse13 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse16 (= .cse29 (select .cse30 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616)))) (.cse22 (= .cse14 0)) (.cse23 (let ((.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse28 (- 4294967297)) (- 4294967296)) (div (+ (* (- 1) .cse28) 4294967297) 4294967296)))) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse24 (<= .cse27 .cse26)) (.cse25 (<= .cse26 .cse27))) (or (let ((.cse19 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|))) (let ((.cse4 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) (.cse5 (div (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296)) (.cse17 (select .cse19 (mod (+ 8 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) 18446744073709551616)))) (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) .cse0 .cse1 .cse2 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) .cse3 (= .cse4 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) 0) 0) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse4)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| (+ (* .cse5 4294967296) 1)) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 1) .cse6 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) .cse7 .cse8 .cse9 (<= .cse5 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2147483648)) .cse10 (<= .cse11 4294967297) .cse12 .cse13 (<= .cse14 0) .cse15 .cse16 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0)) (<= 4294967297 .cse11) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) 1) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse17)) .cse18 (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0) (= (select .cse19 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse17) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0)))) (and .cse0 .cse1 .cse2 .cse3 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296) .cse6 (< .cse20 (+ .cse21 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648))) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (<= .cse11 (+ 4294967296 (* .cse20 4294967296))) .cse15 .cse16 (<= 2 (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) .cse22 .cse23 .cse18 .cse24 .cse25) (and .cse0 .cse1 .cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int|) .cse3 .cse6 .cse7 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) .cse9 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648) 2) 1)) (< (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) (* 2 .cse20)) .cse12 .cse13 .cse15 .cse16 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) .cse22 .cse23 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse18 .cse24 .cse25 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16)))))))) [2022-01-10 23:39:02,756 INFO L854 garLoopResultBuilder]: At program point L583-1(lines 575 584) the Hoare annotation is: (and (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2) (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|)) [2022-01-10 23:39:02,756 INFO L858 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-01-10 23:39:02,756 INFO L854 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse46 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse31 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse48 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse20 (div .cse46 4294967296)) (.cse44 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|))) (let ((.cse45 (select .cse44 (mod (+ 8 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) 18446744073709551616))) (.cse43 (* .cse20 4294967296)) (.cse47 (select .cse48 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse49 (div (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 1) 4294967296)) (.cse50 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) (.cse42 (select .cse31 0)) (.cse21 (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296))) (let ((.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse5 (< .cse21 (+ .cse20 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648)))) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse15 (= .cse42 0)) (.cse22 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) 1)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse23 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) 1)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse24 (= .cse50 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|)) (.cse25 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) 1)) (.cse26 (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) 0) 0)) (.cse27 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse50))) (.cse28 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| (+ (* .cse49 4294967296) 1))) (.cse29 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 1)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) (.cse30 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (.cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) (.cse32 (<= .cse49 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~len#1Int| 2147483648))) (.cse10 (not (= .cse47 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse13 (= .cse47 (select .cse48 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616)))) (.cse14 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse34 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0))) (.cse33 (mod .cse46 4294967296)) (.cse36 (<= 4294967297 (+ .cse43 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse37 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) 1)) (.cse38 (not (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| .cse45))) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse39 (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) 0) 0)) (.cse40 (= (select .cse44 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse45)) (.cse41 (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648) 2) 1)) .cse10 .cse11 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| 2) .cse12 .cse13 (<= 2 (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) .cse14 .cse15 (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (let ((.cse16 (mod (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_630) (select (select (store |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse16 v_ArrVal_634)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse17 (select (select (store |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse16 v_ArrVal_633)) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ (* (- 18446744073709551616) (div (+ 16 .cse17) 18446744073709551616)) 16 .cse17)))) (mod (+ (mod (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (<= (* 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (+ (select (select |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) 0)) 16) 1)) .cse18 .cse19 (<= (+ (* .cse20 8589934592) (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (+ (* 8589934592 .cse21) 8589934592))) (and .cse22 .cse0 .cse1 .cse2 .cse23 .cse3 .cse24 .cse25 .cse26 .cse27 .cse28 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296) .cse29 .cse4 .cse30 .cse5 .cse6 (= (select .cse31 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) .cse7 .cse9 .cse32 .cse11 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ .cse33 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) .cse12 .cse13 (<= (div (+ (- 4294967297) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967297) 4294967296)) .cse34 .cse15 (not .cse18) (let ((.cse35 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse35 (- 4294967297)) (- 4294967296)) (div (+ (* (- 1) .cse35) 4294967297) 4294967296))) .cse36 .cse37 .cse38 .cse19 .cse39 .cse40 .cse41 (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (store (select (store |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1287) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (and .cse22 .cse0 .cse1 .cse23 .cse3 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse4 .cse30 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 (<= .cse42 0) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt| 0) .cse12 .cse13 .cse14 .cse34 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| .cse33) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| .cse43) 4294967297) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse36 .cse18 .cse37 .cse38 .cse19 .cse39 .cse40 .cse41)))))) [2022-01-10 23:39:02,756 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-01-10 23:39:02,756 INFO L854 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse42 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse28 (div .cse42 4294967296))) (let ((.cse43 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1)) (.cse11 (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) (.cse37 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse38 (* .cse28 4294967296))) (let ((.cse36 (+ .cse38 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse32 (select .cse37 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616))) (.cse31 (select .cse37 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse35 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse29 (div .cse11 4294967296)) (.cse40 (mod .cse43 4294967296))) (let ((.cse1 (< .cse40 (* (mod .cse43 2147483648) 2))) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int|)) (.cse3 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296)) (.cse4 (<= (+ 2147483648 (* .cse29 2147483648)) (+ (* .cse28 2147483648) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (.cse5 (= (select (select |#memory_intInt| .cse31) (mod (+ 16 (select .cse35 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)) (mod (+ (mod .cse42 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse7 (not (= .cse32 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse9 (not (= .cse31 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse12 (<= .cse36 (+ 4294967296 (* .cse29 4294967296)))) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 2147483648) 4294967296))) (.cse16 (let ((.cse41 (* .cse40 (- 1)))) (< (div (+ (* (mod (+ .cse40 2147483647) 2147483648) 2) .cse41) 4294967296) (div (+ .cse41 4294967296) 4294967296)))) (.cse17 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse20 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse21 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) (.cse22 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) (.cse24 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse25 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse14 (let ((.cse39 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse39 (- 4294967297)) (- 4294967296)) (div (+ (* (- 1) .cse39) 4294967297) 4294967296)))) (.cse15 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse27 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse30 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (< (mod .cse11 4294967296) (* 2 (mod .cse11 2147483648)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse2 .cse20 .cse3 (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|) (mod (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) 18446744073709551616)) 3) .cse21 .cse4 .cse22 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse12 .cse25 .cse13 .cse26 .cse14 .cse15 .cse27 .cse16 (= 3 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) (<= (+ (* .cse28 8589934592) (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (+ (* 8589934592 .cse29) 8589934592)) .cse17 .cse30) (let ((.cse34 (+ .cse38 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse33 (+ (select (select |#memory_intInt| (select .cse37 0)) 16) 4294967296))) (and .cse18 .cse19 .cse0 .cse20 .cse21 (< .cse29 (+ .cse28 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648))) .cse22 .cse23 .cse6 .cse24 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648) 2) 1)) .cse10 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse25 (= .cse31 .cse32) (<= .cse33 .cse34) .cse26 (= (select .cse35 0) 0) .cse14 (<= 4294967297 .cse36) .cse15 (<= .cse34 4294967299) (<= .cse34 .cse33) .cse27 .cse30)))))))) [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L854 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse42 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse44 (div .cse42 4294967296))) (let ((.cse49 (* .cse44 4294967296)) (.cse50 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse45 (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) (.cse41 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse48 (+ (select (select |#memory_intInt| (select .cse50 0)) 16) 4294967296)) (.cse47 (+ .cse49 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse40 (select .cse50 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse43 (select .cse50 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616)))) (let ((.cse16 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse18 (= .cse40 .cse43)) (.cse19 (<= .cse48 .cse47)) (.cse21 (= (select .cse41 0) 0)) (.cse23 (<= 4294967297 (+ .cse49 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (.cse25 (<= .cse47 4294967299)) (.cse26 (<= .cse47 .cse48)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse5 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) (.cse9 (< .cse45 (+ .cse44 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648)))) (.cse10 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) (.cse13 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) (.cse14 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648) 2) 1))) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse33 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|)) (.cse6 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|)) (.cse7 (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse34 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt| 0)) (.cse22 (let ((.cse46 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse46 (- 4294967297)) (- 4294967296)) (div (+ (* (- 1) .cse46) 4294967297) 4294967296)))) (.cse24 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse27 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0)) (.cse29 (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))))) (or (let ((.cse4 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1))) (let ((.cse3 (mod .cse4 4294967296))) (and .cse0 .cse1 .cse2 (< .cse3 (* (mod .cse4 2147483648) 2)) (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse5 (= (select .cse6 (mod .cse7 18446744073709551616)) 3) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 2147483648) 4294967296)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (let ((.cse28 (* .cse3 (- 1)))) (< (div (+ (* (mod (+ .cse3 2147483647) 2147483648) 2) .cse28) 4294967296) (div (+ .cse28 4294967296) 4294967296))) .cse29))) (let ((.cse35 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|))) (let ((.cse31 (select .cse35 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|))) (let ((.cse30 (select (select |#memory_intInt| .cse31) 16)) (.cse32 (select .cse35 (mod (+ 8 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) 18446744073709551616)))) (and .cse0 .cse1 .cse2 .cse5 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1) .cse8 .cse9 .cse10 (<= .cse30 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| .cse30) (= .cse31 .cse32) .cse11 .cse12 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse34 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 2) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (not (= .cse32 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|)) .cse29 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) 0))))) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296) .cse5 (exists ((|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80_151| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80| Int)) (let ((.cse38 (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80_151| 4294967296))) (let ((.cse37 (+ .cse38 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse36 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1)) (.cse39 (* 4294967296 |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80|))) (and (<= .cse36 .cse37) (< .cse37 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 4294967297)) (<= (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 4294967298) (+ .cse38 .cse39 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (<= (+ (mod .cse36 4294967296) .cse38 .cse39 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| (* 4294967296 (div (+ (- 1) .cse38 .cse39 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| (* (- 1) |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|)) 4294967296))) (+ 8589934595 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|)))))) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int|) .cse9 .cse10 (= (select (select |#memory_intInt| .cse40) (mod (+ 16 (select .cse41 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)) (mod (+ (mod .cse42 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) .cse11 .cse12 (not (= .cse43 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse13 .cse14 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (not (= .cse40 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse15 .cse33 (<= (+ (* .cse44 2147483648) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (+ 4294967295 (* .cse45 2147483648))) (= (select .cse6 .cse7) 2) .cse17 .cse20 .cse34 .cse22 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 2147483648) 2) 1)) .cse24 .cse27 (not (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse29))))))) [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L631-2(lines 631 634) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L861 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L854 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (let ((.cse24 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse33 (div .cse24 4294967296))) (let ((.cse31 (* .cse33 4294967296)) (.cse30 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse17 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.baseInt|) (mod (+ 16 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~head#1.offsetInt|) 18446744073709551616))) (.cse19 (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) (.cse18 (+ .cse33 (div |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648))) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse21 (select .cse30 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse22 (select .cse30 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 8) 18446744073709551616))) (.cse23 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse14 (let ((.cse32 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 1) 4294967296))) (<= (div (+ .cse32 (- 4294967297)) (- 4294967296)) (div (+ (* (- 1) .cse32) 4294967297) 4294967296)))) (.cse20 (+ .cse31 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse15 (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (let ((.cse1 (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 4294967296)) (.cse2 (= (select (select |#memory_intInt| .cse21) (mod (+ 16 (select .cse23 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)) (mod (+ (mod .cse24 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse4 (not (= .cse22 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse6 (not (= .cse21 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse8 (<= .cse20 (+ 4294967296 (* .cse19 4294967296)))) (.cse13 (not (<= .cse18 .cse19))) (.cse16 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (and .cse0 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296) .cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse2 (= 2 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80_151| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80| Int)) (let ((.cse11 (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431| 4294967296)) (.cse9 (* 4294967296 |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80|))) (let ((.cse12 (+ (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_80_151| 4294967296) .cse9 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse10 (+ .cse11 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|))) (and (<= .cse9 .cse10) (<= (+ .cse11 (* |aux_div_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85| 2147483648) 1 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|) .cse12) (<= (+ (* 8589934592 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|) (mod (+ (* 4294967295 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) 4294967296) |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|) 8589934594) (<= .cse12 (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85| 4294967296) .cse11 1 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|)) (< .cse12 (+ (* (mod (+ (* 2147483647 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|) 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) 2147483648) 2) 2 .cse11 |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431|)) (< .cse10 (+ .cse9 4294967296)) (< |aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int_85_431| 4294967296) (<= 4294967297 .cse10))))) .cse13 .cse14 .cse15 .cse16) (and (= .cse17 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) .cse13 .cse14 .cse15 .cse16))) (not (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))))) (let ((.cse26 (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 1))) (let ((.cse28 (+ .cse31 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse27 (+ (select (select |#memory_intInt| (select .cse30 0)) 16) 4294967296)) (.cse25 (mod .cse26 4294967296))) (and (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 0) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) .cse0 (< .cse25 (* (mod .cse26 2147483648) 2)) (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|) (= .cse17 3) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) (< .cse19 .cse18) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) .cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) (< |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| (+ (* (mod |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| 2147483648) 2) 1)) .cse7 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 0) (= .cse21 .cse22) (<= |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_~index#1Int| 2147483648) 4294967296)) (<= .cse27 .cse28) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) (= (select .cse23 0) 0) .cse14 (<= 4294967297 .cse20) .cse15 (<= .cse28 4294967299) (<= .cse28 .cse27) (= |ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 0) (let ((.cse29 (* .cse25 (- 1)))) (< (div (+ (* (mod (+ .cse25 2147483647) 2147483648) 2) .cse29) 4294967296) (div (+ .cse29 4294967296) 4294967296))) (= 3 |ULTIMATE.start_ULTIMATE.start_dll_circular_get_data_at_#res#1Int|) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16))))))))))) [2022-01-10 23:39:02,757 INFO L858 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-01-10 23:39:02,757 INFO L861 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-01-10 23:39:02,758 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-01-10 23:39:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 23:39:02,758 INFO L854 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: false [2022-01-10 23:39:02,758 INFO L858 garLoopResultBuilder]: For program point L635-2(lines 635 640) no Hoare annotation was computed. [2022-01-10 23:39:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 23:39:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2022-01-10 23:39:02,760 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1] [2022-01-10 23:39:02,761 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 23:39:02,778 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Cannot access array with 64bit indices via 1bit term. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation.IcfgTransformationObserver.lambda$0(IcfgTransformationObserver.java:355) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:113) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 23:39:02,781 INFO L158 Benchmark]: Toolchain (without parser) took 70169.46ms. Allocated memory was 219.2MB in the beginning and 465.6MB in the end (delta: 246.4MB). Free memory was 163.7MB in the beginning and 417.3MB in the end (delta: -253.6MB). Peak memory consumption was 254.9MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,781 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 23:39:02,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.74ms. Allocated memory was 219.2MB in the beginning and 294.6MB in the end (delta: 75.5MB). Free memory was 163.6MB in the beginning and 258.8MB in the end (delta: -95.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.62ms. Allocated memory is still 294.6MB. Free memory was 258.8MB in the beginning and 256.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,781 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 294.6MB. Free memory was 256.7MB in the beginning and 254.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,782 INFO L158 Benchmark]: RCFGBuilder took 490.09ms. Allocated memory is still 294.6MB. Free memory was 254.6MB in the beginning and 236.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,782 INFO L158 Benchmark]: IcfgTransformer took 94.00ms. Allocated memory is still 294.6MB. Free memory was 236.2MB in the beginning and 229.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,782 INFO L158 Benchmark]: TraceAbstraction took 69154.43ms. Allocated memory was 294.6MB in the beginning and 465.6MB in the end (delta: 170.9MB). Free memory was 229.4MB in the beginning and 417.3MB in the end (delta: -187.9MB). Peak memory consumption was 243.7MB. Max. memory is 8.0GB. [2022-01-10 23:39:02,783 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 362.74ms. Allocated memory was 219.2MB in the beginning and 294.6MB in the end (delta: 75.5MB). Free memory was 163.6MB in the beginning and 258.8MB in the end (delta: -95.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.62ms. Allocated memory is still 294.6MB. Free memory was 258.8MB in the beginning and 256.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 294.6MB. Free memory was 256.7MB in the beginning and 254.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.09ms. Allocated memory is still 294.6MB. Free memory was 254.6MB in the beginning and 236.2MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * IcfgTransformer took 94.00ms. Allocated memory is still 294.6MB. Free memory was 236.2MB in the beginning and 229.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 69154.43ms. Allocated memory was 294.6MB in the beginning and 465.6MB in the end (delta: 170.9MB). Free memory was 229.4MB in the beginning and 417.3MB in the end (delta: -187.9MB). Peak memory consumption was 243.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 643]: 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 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1255 mSDsluCounter, 2235 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1291 IncrementalHoareTripleChecker+Unchecked, 1917 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3161 IncrementalHoareTripleChecker+Invalid, 4854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 318 mSDtfsCounter, 3161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 433 SyntacticMatches, 33 SemanticMatches, 364 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=10, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 132 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 34 NumberOfFragments, 3772 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1795 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 34494 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 10.4s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 751 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1004 ConstructedInterpolants, 89 QuantifiedInterpolants, 22018 SizeOfPredicates, 199 NumberOfNonLiveVariables, 6186 ConjunctsInSsa, 549 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 263/409 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: 626]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 1bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 1bit term.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 23:39:02,861 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