/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:51:48,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:51:48,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:51:48,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:51:48,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:51:48,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:51:48,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:51:48,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:51:48,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:51:48,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:51:48,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:51:48,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:51:48,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:51:48,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:51:48,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:51:48,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:51:48,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:51:48,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:51:48,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:51:48,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:51:48,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:51:48,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:51:48,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:51:48,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:51:48,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:51:48,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:51:48,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:51:48,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:51:48,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:51:48,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:51:48,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:51:48,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:51:48,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:51:48,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:51:48,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:51:48,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:51:48,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:51:48,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:51:48,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:51:48,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:51:48,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:51:48,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:51:48,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:51:48,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:51:48,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:51:48,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:51:48,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:51:48,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:51:48,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:51:48,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:51:48,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:51:48,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:51:48,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:51:48,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:48,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:51:48,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:51:48,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:51:48,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:51:48,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:51:48,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:51:48,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:51:48,271 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:51:48,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2022-01-10 00:51:48,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9440d49d0/4e42bab754354366a8ef27324df5aece/FLAGf2aa808b2 [2022-01-10 00:51:48,762 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:51:48,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i [2022-01-10 00:51:48,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9440d49d0/4e42bab754354366a8ef27324df5aece/FLAGf2aa808b2 [2022-01-10 00:51:49,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9440d49d0/4e42bab754354366a8ef27324df5aece [2022-01-10 00:51:49,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:51:49,132 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:51:49,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:49,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:51:49,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:51:49,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5341b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49, skipping insertion in model container [2022-01-10 00:51:49,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:51:49,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:51:49,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22663,22676] [2022-01-10 00:51:49,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22734,22747] [2022-01-10 00:51:49,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22862,22875] [2022-01-10 00:51:49,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[23275,23288] [2022-01-10 00:51:49,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[23364,23377] [2022-01-10 00:51:49,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:49,430 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:51:49,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22663,22676] [2022-01-10 00:51:49,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22734,22747] [2022-01-10 00:51:49,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[22862,22875] [2022-01-10 00:51:49,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[23275,23288] [2022-01-10 00:51:49,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-1.i[23364,23377] [2022-01-10 00:51:49,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:49,497 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:51:49,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49 WrapperNode [2022-01-10 00:51:49,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:49,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:49,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:51:49,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:51:49,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,541 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-01-10 00:51:49,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:49,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:51:49,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:51:49,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:51:49,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:51:49,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:51:49,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:51:49,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:51:49,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (1/1) ... [2022-01-10 00:51:49,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:49,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:49,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:51:49,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:51:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:51:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:51:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:51:49,686 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:51:49,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:51:49,946 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:51:49,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:51:49,950 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-10 00:51:49,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:49 BoogieIcfgContainer [2022-01-10 00:51:49,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:51:49,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:51:49,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:51:49,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:51:49,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:49" (1/3) ... [2022-01-10 00:51:49,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5592c7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:49, skipping insertion in model container [2022-01-10 00:51:49,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:49" (2/3) ... [2022-01-10 00:51:49,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5592c7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:49, skipping insertion in model container [2022-01-10 00:51:49,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:49" (3/3) ... [2022-01-10 00:51:49,957 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2022-01-10 00:51:49,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:51:49,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 00:51:49,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:51:49,999 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:51:49,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 00:51:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 00:51:50,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:50,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:50,016 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2022-01-10 00:51:50,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:50,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559654069] [2022-01-10 00:51:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:50,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:50,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:50,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559654069] [2022-01-10 00:51:50,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559654069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:50,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:50,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:50,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386056292] [2022-01-10 00:51:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:50,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:50,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:50,243 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:50,295 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2022-01-10 00:51:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-01-10 00:51:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:50,302 INFO L225 Difference]: With dead ends: 112 [2022-01-10 00:51:50,302 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 00:51:50,304 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-10 00:51:50,306 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:50,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 00:51:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2022-01-10 00:51:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-01-10 00:51:50,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2022-01-10 00:51:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:50,329 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-01-10 00:51:50,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-01-10 00:51:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 00:51:50,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:50,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:50,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:51:50,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2022-01-10 00:51:50,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:50,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482492571] [2022-01-10 00:51:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:50,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:50,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482492571] [2022-01-10 00:51:50,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482492571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:50,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:50,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:50,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277109076] [2022-01-10 00:51:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:50,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:50,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:50,461 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10 00:51:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:50,490 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-01-10 00:51:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10 00:51:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:50,492 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:51:50,492 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:51:50,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:50,493 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:50,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:51:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-01-10 00:51:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-01-10 00:51:50,497 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2022-01-10 00:51:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:50,497 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-01-10 00:51:50,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-10 00:51:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-01-10 00:51:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:51:50,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:50,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:50,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:51:50,498 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2022-01-10 00:51:50,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985767046] [2022-01-10 00:51:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:50,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:50,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985767046] [2022-01-10 00:51:50,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985767046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:50,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:50,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:50,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005215011] [2022-01-10 00:51:50,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:50,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:50,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:50,674 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:50,811 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-01-10 00:51:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:51:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-01-10 00:51:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:50,816 INFO L225 Difference]: With dead ends: 61 [2022-01-10 00:51:50,816 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 00:51:50,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:51:50,819 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:50,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 00:51:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2022-01-10 00:51:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-01-10 00:51:50,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2022-01-10 00:51:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:50,828 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-01-10 00:51:50,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-01-10 00:51:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:51:50,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:50,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:50,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:51:50,829 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2022-01-10 00:51:50,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:50,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925410461] [2022-01-10 00:51:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:50,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:50,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:50,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925410461] [2022-01-10 00:51:50,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925410461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:50,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:50,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:50,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495294139] [2022-01-10 00:51:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:50,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:50,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:50,900 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:50,933 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-01-10 00:51:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-01-10 00:51:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:50,934 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:51:50,934 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:51:50,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:50,941 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:50,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:51:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-01-10 00:51:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-01-10 00:51:50,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-01-10 00:51:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:50,952 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-01-10 00:51:50,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-01-10 00:51:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:51:50,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:50,953 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:50,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:51:50,954 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2022-01-10 00:51:50,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:50,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656041715] [2022-01-10 00:51:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:50,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:51,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656041715] [2022-01-10 00:51:51,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656041715] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689370864] [2022-01-10 00:51:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:51,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:51,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:51,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:51:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:51,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 00:51:51,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:51:51,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:51:51,467 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-10 00:51:51,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-01-10 00:51:51,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,487 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 27 treesize of output 31 [2022-01-10 00:51:51,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:51,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:51,524 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-10 00:51:51,525 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 59 treesize of output 43 [2022-01-10 00:51:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-01-10 00:51:51,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:51,720 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-10 00:51:51,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 62 [2022-01-10 00:51:51,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:51,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:51,865 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 00:51:51,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 52 [2022-01-10 00:51:51,901 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-10 00:51:51,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 21 [2022-01-10 00:51:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:51,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:52,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689370864] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:52,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:52,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-01-10 00:51:52,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557093677] [2022-01-10 00:51:52,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:52,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 00:51:52,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 00:51:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-01-10 00:51:52,120 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:52,459 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-01-10 00:51:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 00:51:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 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 15 [2022-01-10 00:51:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:52,460 INFO L225 Difference]: With dead ends: 64 [2022-01-10 00:51:52,460 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:51:52,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2022-01-10 00:51:52,461 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:52,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 219 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2022-01-10 00:51:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:51:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-01-10 00:51:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-01-10 00:51:52,465 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2022-01-10 00:51:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:52,465 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-01-10 00:51:52,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-01-10 00:51:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:52,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:52,466 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:52,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:51:52,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:52,679 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:52,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2022-01-10 00:51:52,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:52,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493264431] [2022-01-10 00:51:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:52,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:52,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:52,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493264431] [2022-01-10 00:51:52,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493264431] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332138809] [2022-01-10 00:51:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:52,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:52,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:52,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:51:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:52,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-10 00:51:52,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:52,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:51:52,869 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-10 00:51:52,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 77 [2022-01-10 00:51:52,892 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-10 00:51:52,892 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-01-10 00:51:52,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:52,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:52,970 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:51:52,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2022-01-10 00:51:52,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:52,984 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 00:51:52,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 00:51:53,032 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:51:53,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 65 [2022-01-10 00:51:53,156 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-01-10 00:51:53,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 29 [2022-01-10 00:51:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:53,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:53,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2022-01-10 00:51:53,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_23|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_23| v_ArrVal_678) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2022-01-10 00:51:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:53,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332138809] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:53,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:53,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-01-10 00:51:53,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976817475] [2022-01-10 00:51:53,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:53,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 00:51:53,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 00:51:53,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2022-01-10 00:51:53,285 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:53,729 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2022-01-10 00:51:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 00:51:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 00:51:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:53,731 INFO L225 Difference]: With dead ends: 155 [2022-01-10 00:51:53,731 INFO L226 Difference]: Without dead ends: 153 [2022-01-10 00:51:53,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=262, Unknown=2, NotChecked=74, Total=462 [2022-01-10 00:51:53,732 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:53,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 326 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 264 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2022-01-10 00:51:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-10 00:51:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 71. [2022-01-10 00:51:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-01-10 00:51:53,737 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 16 [2022-01-10 00:51:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:53,737 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-01-10 00:51:53,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-01-10 00:51:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 00:51:53,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:53,738 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:53,758 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-10 00:51:53,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:51:53,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2022-01-10 00:51:53,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:53,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072110640] [2022-01-10 00:51:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:53,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:54,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:54,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072110640] [2022-01-10 00:51:54,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072110640] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:54,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299409006] [2022-01-10 00:51:54,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:51:54,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:54,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:54,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:51:54,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:51:54,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:51:54,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-10 00:51:54,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:54,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2022-01-10 00:51:54,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:54,314 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 19 treesize of output 23 [2022-01-10 00:51:54,325 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 00:51:54,325 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-01-10 00:51:54,391 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:51:54,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-01-10 00:51:54,395 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 7 treesize of output 3 [2022-01-10 00:51:54,410 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 00:51:54,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 00:51:54,429 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 23 treesize of output 22 [2022-01-10 00:51:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:51:54,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:51:54,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299409006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:54,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:51:54,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-01-10 00:51:54,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019496044] [2022-01-10 00:51:54,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:54,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:54,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:54,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-01-10 00:51:54,508 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:54,604 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-01-10 00:51:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:51:54,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 00:51:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:54,605 INFO L225 Difference]: With dead ends: 117 [2022-01-10 00:51:54,605 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 00:51:54,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-10 00:51:54,606 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:54,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-01-10 00:51:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 00:51:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-01-10 00:51:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-01-10 00:51:54,611 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 18 [2022-01-10 00:51:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:54,611 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-01-10 00:51:54,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-01-10 00:51:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 00:51:54,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:54,612 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:54,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:51:54,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:54,823 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2022-01-10 00:51:54,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930649399] [2022-01-10 00:51:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:54,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:54,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930649399] [2022-01-10 00:51:54,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930649399] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554879938] [2022-01-10 00:51:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:54,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:54,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:54,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:54,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:51:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:55,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-10 00:51:55,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:51:55,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-01-10 00:51:55,156 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-10 00:51:55,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 82 [2022-01-10 00:51:55,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 00:51:55,210 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-10 00:51:55,211 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-01-10 00:51:55,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:55,275 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:51:55,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 00:51:55,280 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 5 treesize of output 3 [2022-01-10 00:51:55,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,292 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:51:55,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 62 [2022-01-10 00:51:55,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:55,304 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 00:51:55,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 00:51:55,377 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:51:55,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 60 [2022-01-10 00:51:55,381 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-10 00:51:55,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:51:55,516 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:51:55,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 26 [2022-01-10 00:51:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:55,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:55,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1044))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2022-01-10 00:51:55,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_25| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_25|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_25| v_ArrVal_1044))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_25| v_ArrVal_1045) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)))) is different from false [2022-01-10 00:51:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:55,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554879938] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:55,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:55,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-01-10 00:51:55,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950829600] [2022-01-10 00:51:55,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:55,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 00:51:55,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 00:51:55,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2022-01-10 00:51:55,604 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:56,045 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2022-01-10 00:51:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 00:51:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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 19 [2022-01-10 00:51:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:56,046 INFO L225 Difference]: With dead ends: 136 [2022-01-10 00:51:56,046 INFO L226 Difference]: Without dead ends: 134 [2022-01-10 00:51:56,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=500, Unknown=2, NotChecked=98, Total=756 [2022-01-10 00:51:56,047 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 222 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:56,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 244 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 256 Invalid, 0 Unknown, 194 Unchecked, 0.2s Time] [2022-01-10 00:51:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-01-10 00:51:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2022-01-10 00:51:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2022-01-10 00:51:56,052 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 19 [2022-01-10 00:51:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:56,052 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2022-01-10 00:51:56,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-01-10 00:51:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:51:56,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:56,053 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:56,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:51:56,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:56,253 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:51:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2022-01-10 00:51:56,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:56,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178283937] [2022-01-10 00:51:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:56,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:56,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:56,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178283937] [2022-01-10 00:51:56,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178283937] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:56,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775980086] [2022-01-10 00:51:56,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:51:56,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:56,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:56,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:51:56,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:51:56,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:51:56,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-10 00:51:56,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:56,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:56,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-01-10 00:51:56,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:56,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-01-10 00:51:56,828 INFO L353 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-01-10 00:51:56,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2022-01-10 00:51:56,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:56,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:56,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:56,834 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 42 treesize of output 44 [2022-01-10 00:51:56,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:56,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 00:51:56,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:51:56,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 00:51:56,875 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-10 00:51:56,875 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 59 treesize of output 43 [2022-01-10 00:51:57,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:57,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:57,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-01-10 00:51:57,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:57,018 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 00:51:57,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 69 [2022-01-10 00:51:57,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:57,153 INFO L353 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-01-10 00:51:57,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-01-10 00:51:57,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:57,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:57,163 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 00:51:57,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 65 [2022-01-10 00:51:57,293 INFO L353 Elim1Store]: treesize reduction 61, result has 15.3 percent of original size [2022-01-10 00:51:57,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 78 [2022-01-10 00:51:57,302 INFO L353 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-01-10 00:51:57,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 27 [2022-01-10 00:51:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:57,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:06,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775980086] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:06,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:06,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-01-10 00:52:06,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077570090] [2022-01-10 00:52:06,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:06,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 00:52:06,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 00:52:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=310, Unknown=2, NotChecked=0, Total=380 [2022-01-10 00:52:06,781 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:06,977 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-01-10 00:52:06,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:52:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 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-10 00:52:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:06,978 INFO L225 Difference]: With dead ends: 100 [2022-01-10 00:52:06,978 INFO L226 Difference]: Without dead ends: 89 [2022-01-10 00:52:06,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=105, Invalid=445, Unknown=2, NotChecked=0, Total=552 [2022-01-10 00:52:06,978 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:06,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 236 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2022-01-10 00:52:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-10 00:52:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2022-01-10 00:52:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-01-10 00:52:06,986 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 20 [2022-01-10 00:52:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:06,986 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-01-10 00:52:06,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-01-10 00:52:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:52:06,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:06,987 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:07,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 00:52:07,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:07,187 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 220535656, now seen corresponding path program 2 times [2022-01-10 00:52:07,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723368255] [2022-01-10 00:52:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:07,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:52:07,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:07,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723368255] [2022-01-10 00:52:07,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723368255] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:07,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776962293] [2022-01-10 00:52:07,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:52:07,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:07,338 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:07,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 00:52:07,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:52:07,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:52:07,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-10 00:52:07,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-01-10 00:52:07,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-01-10 00:52:07,772 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-01-10 00:52:07,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 93 [2022-01-10 00:52:07,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2022-01-10 00:52:07,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,785 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 21 treesize of output 25 [2022-01-10 00:52:07,808 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-10 00:52:07,808 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-01-10 00:52:07,812 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 18 treesize of output 20 [2022-01-10 00:52:07,880 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:52:07,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 00:52:07,885 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 5 treesize of output 3 [2022-01-10 00:52:07,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:07,892 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 43 treesize of output 39 [2022-01-10 00:52:07,907 INFO L353 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-01-10 00:52:07,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 00:52:07,910 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 18 treesize of output 20 [2022-01-10 00:52:07,961 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-10 00:52:07,967 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 25 treesize of output 24 [2022-01-10 00:52:07,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-10 00:52:08,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:52:08,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-01-10 00:52:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:52:08,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:08,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1448 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 8 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1448) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1449) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 16)) 1)) is different from false [2022-01-10 00:52:08,246 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:52:08,246 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-01-10 00:52:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 00:52:08,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776962293] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:08,337 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:08,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-01-10 00:52:08,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946217448] [2022-01-10 00:52:08,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:08,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 00:52:08,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:08,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 00:52:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2022-01-10 00:52:08,338 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:08,715 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2022-01-10 00:52:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:52:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 00:52:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:08,716 INFO L225 Difference]: With dead ends: 155 [2022-01-10 00:52:08,716 INFO L226 Difference]: Without dead ends: 120 [2022-01-10 00:52:08,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=414, Unknown=1, NotChecked=42, Total=552 [2022-01-10 00:52:08,717 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:08,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 237 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2022-01-10 00:52:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-10 00:52:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-01-10 00:52:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-01-10 00:52:08,722 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 21 [2022-01-10 00:52:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:08,722 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-01-10 00:52:08,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-01-10 00:52:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:52:08,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:08,723 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:08,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 00:52:08,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:08,931 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2022-01-10 00:52:08,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:08,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467762773] [2022-01-10 00:52:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:08,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:09,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:09,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467762773] [2022-01-10 00:52:09,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467762773] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:09,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701425827] [2022-01-10 00:52:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:09,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:09,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:09,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:09,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 00:52:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:09,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-10 00:52:09,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:09,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:52:09,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-01-10 00:52:09,315 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-10 00:52:09,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 81 [2022-01-10 00:52:09,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,321 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 36 treesize of output 38 [2022-01-10 00:52:09,346 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-10 00:52:09,346 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 4 case distinctions, treesize of input 51 treesize of output 46 [2022-01-10 00:52:09,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:09,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:09,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2022-01-10 00:52:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,487 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:52:09,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 81 [2022-01-10 00:52:09,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,493 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 22 treesize of output 24 [2022-01-10 00:52:09,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-01-10 00:52:09,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,513 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 00:52:09,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 00:52:09,607 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:52:09,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 79 [2022-01-10 00:52:09,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:09,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-01-10 00:52:09,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 00:52:10,014 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 00:52:10,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 65 [2022-01-10 00:52:10,023 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-10 00:52:10,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-01-10 00:52:10,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-01-10 00:52:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:10,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:10,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1654)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1656))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 8 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ 16 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2022-01-10 00:52:10,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:52:10,207 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2022-01-10 00:52:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:10,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701425827] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:10,317 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:10,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-01-10 00:52:10,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638707162] [2022-01-10 00:52:10,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:10,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 00:52:10,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 00:52:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2022-01-10 00:52:10,319 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:11,562 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-01-10 00:52:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 00:52:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 00:52:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:11,563 INFO L225 Difference]: With dead ends: 237 [2022-01-10 00:52:11,563 INFO L226 Difference]: Without dead ends: 202 [2022-01-10 00:52:11,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1023, Unknown=1, NotChecked=68, Total=1332 [2022-01-10 00:52:11,564 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 215 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:11,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 511 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 756 Invalid, 0 Unknown, 118 Unchecked, 0.7s Time] [2022-01-10 00:52:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-01-10 00:52:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2022-01-10 00:52:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 133 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2022-01-10 00:52:11,570 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 21 [2022-01-10 00:52:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:11,571 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2022-01-10 00:52:11,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2022-01-10 00:52:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:52:11,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:11,571 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:11,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-10 00:52:11,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:11,783 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2022-01-10 00:52:11,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438505725] [2022-01-10 00:52:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:11,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:12,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:12,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438505725] [2022-01-10 00:52:12,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438505725] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:12,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076624181] [2022-01-10 00:52:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:12,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:12,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:12,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:12,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 00:52:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:12,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-10 00:52:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:12,223 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 00:52:12,223 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-01-10 00:52:12,269 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 00:52:12,269 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-10 00:52:12,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:52:12,420 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-10 00:52:12,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-01-10 00:52:12,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:52:12,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:12,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-01-10 00:52:12,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-01-10 00:52:12,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-10 00:52:12,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-01-10 00:52:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:12,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:12,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 178 [2022-01-10 00:52:12,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 318 [2022-01-10 00:52:36,185 INFO L353 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2022-01-10 00:52:36,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 104 [2022-01-10 00:52:36,191 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:52:36,191 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 102 treesize of output 96 [2022-01-10 00:52:36,196 INFO L353 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-01-10 00:52:36,197 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 124 treesize of output 105 [2022-01-10 00:52:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:36,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076624181] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:36,266 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:36,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2022-01-10 00:52:36,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068885336] [2022-01-10 00:52:36,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:36,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 00:52:36,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 00:52:36,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=467, Unknown=4, NotChecked=0, Total=552 [2022-01-10 00:52:36,267 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:36,596 INFO L93 Difference]: Finished difference Result 157 states and 193 transitions. [2022-01-10 00:52:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:52:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 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 24 [2022-01-10 00:52:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:36,597 INFO L225 Difference]: With dead ends: 157 [2022-01-10 00:52:36,597 INFO L226 Difference]: Without dead ends: 155 [2022-01-10 00:52:36,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=103, Invalid=543, Unknown=4, NotChecked=0, Total=650 [2022-01-10 00:52:36,597 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 71 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:36,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 385 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 346 Invalid, 0 Unknown, 300 Unchecked, 0.3s Time] [2022-01-10 00:52:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-10 00:52:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2022-01-10 00:52:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 138 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-01-10 00:52:36,603 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 24 [2022-01-10 00:52:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:36,604 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-01-10 00:52:36,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-01-10 00:52:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:52:36,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:36,604 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:36,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 00:52:36,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 00:52:36,823 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2022-01-10 00:52:36,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8535971] [2022-01-10 00:52:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:36,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:36,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8535971] [2022-01-10 00:52:36,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8535971] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178925361] [2022-01-10 00:52:36,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:52:36,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:36,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:36,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:36,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 00:52:38,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 00:52:38,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:52:38,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-10 00:52:38,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:38,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-01-10 00:52:38,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2022-01-10 00:52:38,152 INFO L353 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-01-10 00:52:38,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 79 [2022-01-10 00:52:38,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,158 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 42 treesize of output 44 [2022-01-10 00:52:38,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:38,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 00:52:38,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:38,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-10 00:52:38,185 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-10 00:52:38,185 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 59 treesize of output 43 [2022-01-10 00:52:38,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-01-10 00:52:38,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,318 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-10 00:52:38,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2022-01-10 00:52:38,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,449 INFO L353 Elim1Store]: treesize reduction 60, result has 15.5 percent of original size [2022-01-10 00:52:38,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-01-10 00:52:38,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,455 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-10 00:52:38,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 65 [2022-01-10 00:52:38,590 INFO L353 Elim1Store]: treesize reduction 108, result has 16.9 percent of original size [2022-01-10 00:52:38,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 72 [2022-01-10 00:52:38,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:38,598 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-10 00:52:38,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-01-10 00:52:38,719 INFO L353 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2022-01-10 00:52:38,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 60 [2022-01-10 00:52:38,725 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 00:52:38,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2022-01-10 00:52:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:38,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:44,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178925361] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:44,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:44,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-01-10 00:52:44,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393766121] [2022-01-10 00:52:44,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:44,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 00:52:44,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 00:52:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=311, Unknown=1, NotChecked=0, Total=380 [2022-01-10 00:52:44,411 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:44,731 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2022-01-10 00:52:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:52:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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 25 [2022-01-10 00:52:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:44,731 INFO L225 Difference]: With dead ends: 154 [2022-01-10 00:52:44,732 INFO L226 Difference]: Without dead ends: 126 [2022-01-10 00:52:44,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=96, Invalid=409, Unknown=1, NotChecked=0, Total=506 [2022-01-10 00:52:44,732 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:44,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 312 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2022-01-10 00:52:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-10 00:52:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-01-10 00:52:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 125 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2022-01-10 00:52:44,738 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 25 [2022-01-10 00:52:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:44,738 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2022-01-10 00:52:44,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2022-01-10 00:52:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 00:52:44,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:44,738 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:44,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 00:52:44,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 00:52:44,952 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2022-01-10 00:52:44,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:44,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694099417] [2022-01-10 00:52:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:44,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:45,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:45,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694099417] [2022-01-10 00:52:45,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694099417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647193218] [2022-01-10 00:52:45,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:45,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:45,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:45,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 00:52:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:45,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-10 00:52:45,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:45,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:52:45,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-10 00:52:45,456 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-10 00:52:45,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 74 [2022-01-10 00:52:45,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,462 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 36 treesize of output 38 [2022-01-10 00:52:45,468 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 00:52:45,468 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 35 treesize of output 27 [2022-01-10 00:52:45,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:45,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,556 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-10 00:52:45,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2022-01-10 00:52:45,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:52:45,575 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-01-10 00:52:45,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 81 [2022-01-10 00:52:45,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:52:45,829 INFO L353 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-01-10 00:52:45,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 82 [2022-01-10 00:52:45,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:45,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:52:45,850 INFO L353 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-01-10 00:52:45,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 68 [2022-01-10 00:52:53,896 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-01-10 00:52:53,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 131 treesize of output 119 [2022-01-10 00:52:53,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:53,917 INFO L353 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-01-10 00:52:53,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 64 treesize of output 75 [2022-01-10 00:52:53,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-01-10 00:52:54,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-10 00:52:54,123 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:52:54,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 00:52:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:54,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:52:54,213 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2313 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2312 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2312) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))) is different from false [2022-01-10 00:52:54,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2309 Int) (v_ArrVal_2311 Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8))) (and (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2309)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) (and (forall ((v_ArrVal_2313 (Array Int Int))) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_2309)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2313)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2312 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8) v_ArrVal_2311)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2312)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))))) is different from false [2022-01-10 00:52:54,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2309 Int) (v_ArrVal_2311 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2313) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2312 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2312)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))))) is different from false [2022-01-10 00:52:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 00:52:54,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647193218] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:52:54,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:52:54,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2022-01-10 00:52:54,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543210706] [2022-01-10 00:52:54,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:52:54,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 00:52:54,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:52:54,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 00:52:54,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=421, Unknown=4, NotChecked=132, Total=650 [2022-01-10 00:52:54,677 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:56,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse8 (select .cse2 0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2309 Int) (v_ArrVal_2311 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2313) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2312 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2312)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select .cse2 8) 0) (= (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse4 .cse5) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse7) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse7) 0) (not (= .cse8 .cse0)) (= (select .cse3 .cse5) 0) (< 0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 1)) (= |c_ULTIMATE.start_main_~item~0#1.base| 0) (not (= .cse0 0)) (= (select .cse6 8) 0) (not (= .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2022-01-10 00:52:56,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse7 (select .cse2 0))) (and (not (= .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int) (v_ArrVal_2309 Int) (v_ArrVal_2311 Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)) (and (forall ((v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2309)) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2313) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0)) (forall ((v_ArrVal_2312 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0 0) 8 v_ArrVal_2311)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_2312)) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) 0))))) (= (select .cse2 8) 0) (= (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select .cse4 .cse5) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (not (= .cse7 .cse0)) (= (select .cse3 .cse5) 0) (not (= .cse0 0)) (= (select .cse6 8) 0) (not (= .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|))))))) is different from false [2022-01-10 00:52:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:52:57,378 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-01-10 00:52:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:52:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 00:52:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:52:57,379 INFO L225 Difference]: With dead ends: 165 [2022-01-10 00:52:57,380 INFO L226 Difference]: Without dead ends: 154 [2022-01-10 00:52:57,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=197, Invalid=873, Unknown=6, NotChecked=330, Total=1406 [2022-01-10 00:52:57,380 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:52:57,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 438 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 264 Unchecked, 0.1s Time] [2022-01-10 00:52:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-01-10 00:52:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2022-01-10 00:52:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 135 states have (on average 1.2666666666666666) internal successors, (171), 136 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2022-01-10 00:52:57,386 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 27 [2022-01-10 00:52:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:52:57,387 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2022-01-10 00:52:57,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:52:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2022-01-10 00:52:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 00:52:57,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:52:57,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:52:57,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 00:52:57,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 00:52:57,604 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 00:52:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:52:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1921519731, now seen corresponding path program 1 times [2022-01-10 00:52:57,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:52:57,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721093512] [2022-01-10 00:52:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:57,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:52:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:52:57,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:52:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721093512] [2022-01-10 00:52:57,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721093512] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:52:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096300362] [2022-01-10 00:52:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:52:57,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:52:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:52:57,726 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:52:57,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 00:52:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:52:57,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-10 00:52:57,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:52:57,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:57,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-01-10 00:52:57,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:57,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2022-01-10 00:52:57,962 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-01-10 00:52:57,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2022-01-10 00:52:57,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:57,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:57,968 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 36 treesize of output 38 [2022-01-10 00:52:57,973 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 00:52:57,973 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 35 treesize of output 27 [2022-01-10 00:52:57,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-10 00:52:58,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:58,041 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 00:52:58,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2022-01-10 00:52:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:58,058 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-01-10 00:52:58,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2022-01-10 00:52:58,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:58,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:52:58,174 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-01-10 00:52:58,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2022-01-10 00:52:58,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:52:58,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:52:58,194 INFO L353 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2022-01-10 00:52:58,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 68