/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_SUM.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:24:31,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:24:31,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:24:31,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:24:31,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:24:31,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:24:31,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:24:31,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:24:31,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:24:31,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:24:31,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:24:31,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:24:31,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:24:31,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:24:31,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:24:31,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:24:31,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:24:31,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:24:31,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:24:31,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:24:31,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:24:31,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:24:31,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:24:31,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:24:31,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:24:31,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:24:31,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:24:31,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:24:31,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:24:31,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:24:31,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:24:31,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:24:31,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:24:31,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:24:31,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:24:31,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:24:31,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:24:31,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:24:31,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:24:31,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:24:31,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:24:31,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:24:31,869 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:24:31,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:24:31,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:24:31,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:24:31,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:24:31,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:24:31,871 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:24:31,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:24:31,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:24:31,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:24:31,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:24:31,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:24:31,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:31,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:24:31,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:24:31,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:24:31,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:24:31,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:24:31,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:24:31,876 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:24:31,876 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:24:32,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:24:32,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:24:32,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:24:32,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:24:32,135 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:24:32,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2022-01-11 05:24:32,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b5d1ffe/2a771a6dffd34f67982190c81dd5153f/FLAG63247ba4e [2022-01-11 05:24:32,709 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:24:32,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2022-01-11 05:24:32,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b5d1ffe/2a771a6dffd34f67982190c81dd5153f/FLAG63247ba4e [2022-01-11 05:24:33,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b5d1ffe/2a771a6dffd34f67982190c81dd5153f [2022-01-11 05:24:33,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:24:33,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:24:33,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:33,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:24:33,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:24:33,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403b712f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33, skipping insertion in model container [2022-01-11 05:24:33,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:24:33,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:24:33,508 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-ext2-properties/simple_search_value-2.i[23220,23233] [2022-01-11 05:24:33,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:33,521 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:24:33,547 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-ext2-properties/simple_search_value-2.i[23220,23233] [2022-01-11 05:24:33,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:33,566 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:24:33,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33 WrapperNode [2022-01-11 05:24:33,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:33,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:33,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:24:33,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:24:33,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,605 INFO L137 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2022-01-11 05:24:33,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:33,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:24:33,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:24:33,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:24:33,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:24:33,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:24:33,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:24:33,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:24:33,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (1/1) ... [2022-01-11 05:24:33,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:33,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:33,688 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-11 05:24:33,700 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-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:24:33,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:24:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:24:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:24:33,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:24:33,840 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:24:33,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:24:34,007 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:24:34,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:24:34,011 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 05:24:34,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:34 BoogieIcfgContainer [2022-01-11 05:24:34,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:24:34,013 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:24:34,013 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:24:34,017 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:24:34,019 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:34" (1/1) ... [2022-01-11 05:24:34,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:34 BasicIcfg [2022-01-11 05:24:34,100 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:24:34,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:24:34,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:24:34,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:24:34,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:24:33" (1/4) ... [2022-01-11 05:24:34,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617c086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:34, skipping insertion in model container [2022-01-11 05:24:34,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:33" (2/4) ... [2022-01-11 05:24:34,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617c086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:34, skipping insertion in model container [2022-01-11 05:24:34,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:34" (3/4) ... [2022-01-11 05:24:34,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617c086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:24:34, skipping insertion in model container [2022-01-11 05:24:34,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:34" (4/4) ... [2022-01-11 05:24:34,111 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.iTransformedIcfg [2022-01-11 05:24:34,115 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:24:34,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:24:34,159 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:24:34,166 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-11 05:24:34,166 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:24:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 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-11 05:24:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:24:34,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:34,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:34,181 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2132438605, now seen corresponding path program 1 times [2022-01-11 05:24:34,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:34,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012818561] [2022-01-11 05:24:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,391 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-11 05:24:34,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:34,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012818561] [2022-01-11 05:24:34,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012818561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:34,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:34,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:24:34,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316083758] [2022-01-11 05:24:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:34,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:24:34,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:24:34,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:24:34,424 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.5) internal successors, (30), 21 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11 05:24:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:34,434 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-01-11 05:24:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:24:34,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-01-11 05:24:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:34,441 INFO L225 Difference]: With dead ends: 35 [2022-01-11 05:24:34,442 INFO L226 Difference]: Without dead ends: 16 [2022-01-11 05:24:34,451 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-11 05:24:34,456 INFO L933 BasicCegarLoop]: 27 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, 27 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-11 05:24:34,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-11 05:24:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-11 05:24:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-11 05:24:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-01-11 05:24:34,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2022-01-11 05:24:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:34,480 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-01-11 05:24:34,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11 05:24:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-01-11 05:24:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:24:34,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:34,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:34,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:24:34,482 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2132437644, now seen corresponding path program 1 times [2022-01-11 05:24:34,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:34,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623031240] [2022-01-11 05:24:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,585 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-11 05:24:34,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:34,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623031240] [2022-01-11 05:24:34,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623031240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:34,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:34,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:24:34,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865174834] [2022-01-11 05:24:34,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:34,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:24:34,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:34,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:24:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:24:34,590 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11 05:24:34,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:34,647 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-01-11 05:24:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:24:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-01-11 05:24:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:34,649 INFO L225 Difference]: With dead ends: 28 [2022-01-11 05:24:34,649 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 05:24:34,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:24:34,650 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:34,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 05:24:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-01-11 05:24:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-11 05:24:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-01-11 05:24:34,654 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-01-11 05:24:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:34,654 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-01-11 05:24:34,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11 05:24:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-01-11 05:24:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:24:34,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:34,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:34,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:24:34,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 716219169, now seen corresponding path program 1 times [2022-01-11 05:24:34,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422666678] [2022-01-11 05:24:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:34,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422666678] [2022-01-11 05:24:34,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422666678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:34,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:34,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:24:34,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943669641] [2022-01-11 05:24:34,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:34,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:24:34,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:34,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:24:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:24:34,750 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11 05:24:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:34,774 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-01-11 05:24:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:24:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-01-11 05:24:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:34,775 INFO L225 Difference]: With dead ends: 33 [2022-01-11 05:24:34,775 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 05:24:34,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:24:34,777 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:34,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 05:24:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-01-11 05:24:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-11 05:24:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-01-11 05:24:34,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2022-01-11 05:24:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:34,781 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-01-11 05:24:34,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-11 05:24:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-01-11 05:24:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:24:34,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:34,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:34,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:24:34,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:34,782 INFO L85 PathProgramCache]: Analyzing trace with hash 717142690, now seen corresponding path program 1 times [2022-01-11 05:24:34,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:34,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280915391] [2022-01-11 05:24:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:34,860 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-11 05:24:34,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280915391] [2022-01-11 05:24:34,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280915391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:34,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:34,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:34,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548223109] [2022-01-11 05:24:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:34,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:24:34,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:24:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:24:34,865 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 05:24:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:34,888 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-01-11 05:24:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:24:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-11 05:24:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:34,891 INFO L225 Difference]: With dead ends: 40 [2022-01-11 05:24:34,891 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 05:24:34,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 05:24:34,899 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:34,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 05:24:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-01-11 05:24:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-11 05:24:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-01-11 05:24:34,910 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-01-11 05:24:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:34,910 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-01-11 05:24:34,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 05:24:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-01-11 05:24:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:24:34,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:34,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:34,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:24:34,912 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash 159262064, now seen corresponding path program 1 times [2022-01-11 05:24:34,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:34,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519165462] [2022-01-11 05:24:34,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:34,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:35,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519165462] [2022-01-11 05:24:35,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519165462] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751562379] [2022-01-11 05:24:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:35,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:35,083 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-11 05:24:35,085 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-11 05:24:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:35,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-11 05:24:35,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:35,265 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-11 05:24:35,332 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:35,332 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-11 05:24:35,337 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 11 treesize of output 7 [2022-01-11 05:24:35,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:35,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-11 05:24:35,447 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 14 treesize of output 16 [2022-01-11 05:24:35,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:35,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,508 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 15 treesize of output 10 [2022-01-11 05:24:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:35,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:35,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| Int) (v_ArrVal_114 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|)) (not (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_114) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|) 2)))) is different from false [2022-01-11 05:24:35,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| Int) (v_ArrVal_110 Int) (v_ArrVal_114 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_110)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_114) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|) 2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|)))) is different from false [2022-01-11 05:24:35,710 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:35,714 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 2 case distinctions, treesize of input 26 treesize of output 32 [2022-01-11 05:24:35,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:35,728 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 33 treesize of output 36 [2022-01-11 05:24:35,738 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 20 treesize of output 18 [2022-01-11 05:24:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-11 05:24:35,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751562379] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:35,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:35,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2022-01-11 05:24:35,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907928123] [2022-01-11 05:24:35,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:35,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:24:35,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:24:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=147, Unknown=2, NotChecked=50, Total=240 [2022-01-11 05:24:35,951 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-11 05:24:36,340 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| Int) (v_ArrVal_110 Int) (v_ArrVal_114 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_110)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_114) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|) 2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-11 05:24:36,686 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| Int) (v_ArrVal_110 Int) (v_ArrVal_114 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_110)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_114) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|) 2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_3|)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-11 05:24:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:36,761 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-01-11 05:24:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:24:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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) Word has length 17 [2022-01-11 05:24:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:36,762 INFO L225 Difference]: With dead ends: 43 [2022-01-11 05:24:36,762 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:24:36,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=197, Unknown=4, NotChecked=124, Total=380 [2022-01-11 05:24:36,763 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:36,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 107 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-01-11 05:24:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:24:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-01-11 05:24:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-11 05:24:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-11 05:24:36,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-01-11 05:24:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:36,766 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-11 05:24:36,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-11 05:24:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-11 05:24:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:24:36,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:36,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:36,787 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-11 05:24:36,975 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-11 05:24:36,976 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1860968418, now seen corresponding path program 2 times [2022-01-11 05:24:36,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474754840] [2022-01-11 05:24:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:36,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:37,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474754840] [2022-01-11 05:24:37,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474754840] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:37,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611484367] [2022-01-11 05:24:37,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:24:37,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:37,049 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-11 05:24:37,050 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-11 05:24:37,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:24:37,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:37,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-11 05:24:37,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:37,186 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-11 05:24:37,242 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 11 treesize of output 7 [2022-01-11 05:24:37,259 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:37,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-11 05:24:37,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:37,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-11 05:24:37,347 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:24:37,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-11 05:24:37,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:37,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:37,439 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 14 treesize of output 16 [2022-01-11 05:24:37,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:37,479 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:37,479 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 15 treesize of output 10 [2022-01-11 05:24:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:37,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:37,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|)) (not (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_209) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|) 2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-11 05:24:37,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|)) (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_206) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_209) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-11 05:24:37,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_4| Int)) (or (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_206) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_4| v_ArrVal_209) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_4|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_10| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-11 05:24:37,723 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:37,723 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 2 case distinctions, treesize of input 29 treesize of output 35 [2022-01-11 05:24:37,733 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:37,734 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 131 treesize of output 130 [2022-01-11 05:24:37,742 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 114 treesize of output 110 [2022-01-11 05:24:37,748 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 110 treesize of output 102 [2022-01-11 05:24:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-11 05:24:38,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611484367] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:38,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:38,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2022-01-11 05:24:38,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232102103] [2022-01-11 05:24:38,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:38,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:24:38,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:24:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=256, Unknown=4, NotChecked=102, Total=420 [2022-01-11 05:24:38,217 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 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-11 05:24:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:38,472 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-01-11 05:24:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:24:38,473 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 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 20 [2022-01-11 05:24:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:38,473 INFO L225 Difference]: With dead ends: 46 [2022-01-11 05:24:38,473 INFO L226 Difference]: Without dead ends: 31 [2022-01-11 05:24:38,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=380, Unknown=4, NotChecked=126, Total=600 [2022-01-11 05:24:38,474 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:38,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 133 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 107 Unchecked, 0.1s Time] [2022-01-11 05:24:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-11 05:24:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-11 05:24:38,478 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-11 05:24:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-11 05:24:38,478 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2022-01-11 05:24:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:38,479 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-11 05:24:38,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 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-11 05:24:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-11 05:24:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 05:24:38,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:38,482 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:38,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:38,695 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-11 05:24:38,696 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -399001552, now seen corresponding path program 3 times [2022-01-11 05:24:38,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158591141] [2022-01-11 05:24:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:38,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:38,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158591141] [2022-01-11 05:24:38,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158591141] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687146058] [2022-01-11 05:24:38,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:24:38,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:38,828 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-11 05:24:38,829 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-11 05:24:39,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-11 05:24:39,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:39,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-11 05:24:39,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:39,372 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-11 05:24:39,438 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:39,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-11 05:24:39,447 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 11 treesize of output 7 [2022-01-11 05:24:39,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:39,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-11 05:24:39,551 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-11 05:24:39,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-01-11 05:24:39,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:39,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:39,668 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:24:39,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-11 05:24:39,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:39,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:39,768 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 14 treesize of output 16 [2022-01-11 05:24:39,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:39,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:39,808 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 15 treesize of output 10 [2022-01-11 05:24:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:39,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:39,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int)) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)) (not (= 2 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))))) is different from false [2022-01-11 05:24:39,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_334) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)))) is different from false [2022-01-11 05:24:39,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)) (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_334) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))))) is different from false [2022-01-11 05:24:39,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_330 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|) 0)) (not (= 2 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_330) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_334) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)))) is different from false [2022-01-11 05:24:40,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_330 (Array Int Int)) (v_ArrVal_328 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_9| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_9| v_ArrVal_328) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|) 0)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_9|) 0)) (not (= 2 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_330) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_9| v_ArrVal_334) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)))) is different from false [2022-01-11 05:24:40,277 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:40,278 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 2 case distinctions, treesize of input 32 treesize of output 38 [2022-01-11 05:24:40,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:40,289 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 519 treesize of output 510 [2022-01-11 05:24:40,316 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 494 treesize of output 486 [2022-01-11 05:24:40,323 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 486 treesize of output 454 [2022-01-11 05:24:40,335 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 454 treesize of output 438 [2022-01-11 05:24:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-11 05:24:41,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687146058] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:41,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:41,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 26 [2022-01-11 05:24:41,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89639779] [2022-01-11 05:24:41,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:41,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 05:24:41,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 05:24:41,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=357, Unknown=6, NotChecked=210, Total=650 [2022-01-11 05:24:41,378 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 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-11 05:24:41,650 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_330 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|) 0)) (not (= 2 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_330) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_334) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)))) (<= (+ |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| (* (div (+ 2147483649 (* |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| (- 1)) (* (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| 1) 4294967296) 2147483648)) 2147483648) 4294967296)) 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_334) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))))) is different from false [2022-01-11 05:24:41,654 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int) (v_ArrVal_334 (Array Int Int))) (or (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)) (not (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_334) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))))) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| Int)) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|)) (not (= 2 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_19|))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| (+ 3 (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~counter~0#1Int| 2147483648) 4294967296)))) is different from false [2022-01-11 05:24:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:41,684 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-01-11 05:24:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-11 05:24:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 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) Word has length 23 [2022-01-11 05:24:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:41,685 INFO L225 Difference]: With dead ends: 53 [2022-01-11 05:24:41,685 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:24:41,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=493, Unknown=10, NotChecked=364, Total=992 [2022-01-11 05:24:41,686 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:41,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2022-01-11 05:24:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:24:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-11 05:24:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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-11 05:24:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-11 05:24:41,690 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2022-01-11 05:24:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:41,690 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-11 05:24:41,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 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-11 05:24:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-11 05:24:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:24:41,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:41,691 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:41,737 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-11 05:24:41,892 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-11 05:24:41,892 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1629534434, now seen corresponding path program 1 times [2022-01-11 05:24:41,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155389449] [2022-01-11 05:24:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:41,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:41,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155389449] [2022-01-11 05:24:41,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155389449] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:41,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562179999] [2022-01-11 05:24:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:41,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:42,012 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-11 05:24:42,043 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-11 05:24:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:42,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-11 05:24:42,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:42,379 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-11 05:24:42,437 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 11 treesize of output 7 [2022-01-11 05:24:42,459 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:42,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-11 05:24:42,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:42,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-11 05:24:42,567 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:42,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-11 05:24:42,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:42,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:42,660 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 14 treesize of output 16 [2022-01-11 05:24:42,686 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:42,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-11 05:24:42,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:42,794 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:24:42,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-11 05:24:42,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:42,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:24:42,895 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 14 treesize of output 16 [2022-01-11 05:24:42,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:42,939 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:42,940 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 15 treesize of output 10 [2022-01-11 05:24:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:42,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:43,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (< (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12))) is different from false [2022-01-11 05:24:43,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (< (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_496) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12))) is different from false [2022-01-11 05:24:43,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13|) 0)) (< (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_496) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12))) is different from false [2022-01-11 05:24:43,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13|) 0)) (< (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_491) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_496) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12))) is different from false [2022-01-11 05:24:43,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 0)) (< (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_491) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_496) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12) (not (= (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13|) 0)))) is different from false [2022-01-11 05:24:43,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 0)) (< (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_487) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_491) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_496) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12) (not (= (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13|) 0)))) is different from false [2022-01-11 05:24:43,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| Int) (v_ArrVal_485 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_496 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| Int) (v_ArrVal_487 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (let ((.cse0 (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_485))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select (store .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13|) 0)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15|) 0)) (< (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_487) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_491) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_496) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_13| v_ArrVal_498) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_30|) 12) (not (= (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 0))))) is different from false [2022-01-11 05:24:43,777 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:43,778 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 2 case distinctions, treesize of input 34 treesize of output 40 [2022-01-11 05:24:43,793 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:43,793 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 7742 treesize of output 7621 [2022-01-11 05:24:43,838 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 7606 treesize of output 7350 [2022-01-11 05:24:43,881 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 3739 treesize of output 3611 [2022-01-11 05:24:43,933 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 7222 treesize of output 6710 [2022-01-11 05:24:43,971 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 6710 treesize of output 6646