/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:08:29,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:08:29,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:08:29,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:08:29,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:08:29,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:08:29,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:08:29,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:08:29,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:08:29,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:08:29,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:08:29,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:08:29,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:08:29,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:08:29,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:08:29,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:08:29,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:08:29,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:08:29,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:08:29,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:08:29,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:08:29,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:08:29,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:08:29,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:08:29,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:08:29,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:08:29,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:08:29,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:08:29,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:08:29,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:08:29,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:08:29,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:08:29,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:08:29,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:08:29,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:08:29,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:08:29,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:08:29,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:08:29,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:08:29,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:08:29,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:08:29,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:08:29,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:08:29,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:08:29,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:08:29,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:08:29,897 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:08:29,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:08:29,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:08:29,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:08:29,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:08:29,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:08:29,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:08:29,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:08:29,899 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:08:29,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:08:29,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:08:29,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:08:29,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:08:29,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:08:29,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:08:29,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:08:29,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:08:29,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:08:29,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:08:29,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:08:29,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:08:29,902 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-bitabs/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 [2021-01-07 00:08:30,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:08:30,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:08:30,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:08:30,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:08:30,396 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:08:30,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2021-01-07 00:08:30,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6e37d8390/f10782aec4c347988e8482afb9742366/FLAG7c29da989 [2021-01-07 00:08:31,682 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:08:31,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i [2021-01-07 00:08:31,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6e37d8390/f10782aec4c347988e8482afb9742366/FLAG7c29da989 [2021-01-07 00:08:32,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6e37d8390/f10782aec4c347988e8482afb9742366 [2021-01-07 00:08:32,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:08:32,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:08:32,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:08:32,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:08:32,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:08:32,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:08:32" (1/1) ... [2021-01-07 00:08:32,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1ba7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:32, skipping insertion in model container [2021-01-07 00:08:32,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:08:32" (1/1) ... [2021-01-07 00:08:32,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:08:32,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:08:32,595 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2021-01-07 00:08:32,607 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2021-01-07 00:08:32,647 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:08:32,657 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:08:33,985 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:33,986 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:33,986 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:33,987 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:33,988 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:08:34,003 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,004 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,006 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,007 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2021-01-07 00:08:34,009 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,010 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,011 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:34,012 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem332,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem343,],base],StructAccessExpression[IdentifierExpression[#t~mem343,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem344,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem344,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],base],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],StructAccessExpression[IdentifierExpression[#t~mem355,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem362,],base],StructAccessExpression[IdentifierExpression[#t~mem362,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem364,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem364,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem408,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem408,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem410,],base],StructAccessExpression[IdentifierExpression[#t~mem410,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem411,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem411,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem412,],base],StructAccessExpression[IdentifierExpression[#t~mem412,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:08:34,553 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:08:34,554 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:08:34,555 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:08:34,557 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:08:34,559 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:08:34,560 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:08:34,561 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:08:34,562 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:08:34,563 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:08:34,564 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~impl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~impl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem539,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem539,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem542,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem542,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2021-01-07 00:08:34,841 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~4,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~0,],ptr] left hand side expression in assignment: lhs: VariableLHS[~c~5,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~1,],ptr] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~6,] left hand side expression in assignment: lhs: VariableLHS[~b~4,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~u~2,],ptr] left hand side expression in assignment: lhs: VariableLHS[~hash_code~0,] [2021-01-07 00:08:35,413 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,414 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~state~3,] left hand side expression in assignment: lhs: VariableLHS[~min_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],hash_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],equals_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],destroy_key_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],destroy_value_fn] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],alloc] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],entry_count] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~template~0,],max_load_factor] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: IdentifierExpression[~to,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] [2021-01-07 00:08:35,444 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~entry~1,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] [2021-01-07 00:08:35,445 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] [2021-01-07 00:08:35,453 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,454 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rval~11,] left hand side expression in assignment: address: IdentifierExpression[~victim~0,] left hand side expression in assignment: lhs: VariableLHS[~entry,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~rv~2,] left hand side expression in assignment: lhs: VariableLHS[~state~6,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx~1,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~new_entry~0,],element],key] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~new_entry~0,],element],value] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~new_entry~0,],hash_code] left hand side expression in assignment: lhs: VariableLHS[~entry~4,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p_elem~0,],base],StructAccessExpression[IdentifierExpression[~p_elem~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~p_elem~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~p_elem~0,],offset]]]] [2021-01-07 00:08:35,474 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,476 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~state,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~index~3,],IntegerLiteral[4294967296]]]]]] [2021-01-07 00:08:35,477 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2021-01-07 00:08:35,477 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,477 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,478 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,478 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~p_value,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~iter~1,],map] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~iter~1,],limit] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~state~13,],offset]]]] [2021-01-07 00:08:35,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:08:35,566 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:08:35,582 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4503,4516] [2021-01-07 00:08:35,583 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_unbounded_harness.i[4563,4576] [2021-01-07 00:08:35,586 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:08:35,587 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:08:35,699 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,700 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,700 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,701 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,701 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:08:35,714 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,716 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,717 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,717 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2021-01-07 00:08:35,718 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,719 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,719 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:35,720 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem345,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem345,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem356,],base],StructAccessExpression[IdentifierExpression[#t~mem356,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem357,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem357,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem358,],base],StructAccessExpression[IdentifierExpression[#t~mem358,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem359,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem372,],base],StructAccessExpression[IdentifierExpression[#t~mem372,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem379,],base],StructAccessExpression[IdentifierExpression[#t~mem379,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem381,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem381,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem425,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem425,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem427,],base],StructAccessExpression[IdentifierExpression[#t~mem427,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem428,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem428,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem429,],base],StructAccessExpression[IdentifierExpression[#t~mem429,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:08:35,771 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:08:35,772 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:08:35,773 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:08:35,774 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:08:35,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:08:35,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:08:35,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:08:35,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:08:35,777 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:08:35,777 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~impl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~impl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem557,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem557,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem560,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem560,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2021-01-07 00:08:35,824 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~b~1,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~4,] left hand side expression in assignment: lhs: VariableLHS[~b~2,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~0,],base],StructAccessExpression[IdentifierExpression[~#u~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~c~5,] left hand side expression in assignment: lhs: VariableLHS[~b~3,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~1,],base],StructAccessExpression[IdentifierExpression[~#u~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: address: IdentifierExpression[~pc,] left hand side expression in assignment: address: IdentifierExpression[~pb,] left hand side expression in assignment: lhs: VariableLHS[~c~6,] left hand side expression in assignment: lhs: VariableLHS[~b~4,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#u~2,],base],StructAccessExpression[IdentifierExpression[~#u~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~hash_code~0,] [2021-01-07 00:08:36,028 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,029 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~state~3,] left hand side expression in assignment: lhs: VariableLHS[~min_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~template,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~template,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#template~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~#template~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: IdentifierExpression[~to,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] [2021-01-07 00:08:36,043 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~entry~1,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: lhs: VariableLHS[~rv~0,] [2021-01-07 00:08:36,045 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rv~0,] left hand side expression in assignment: address: IdentifierExpression[~p_entry,] left hand side expression in assignment: address: IdentifierExpression[~p_probe_idx,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] [2021-01-07 00:08:36,052 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,052 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~rval~11,] left hand side expression in assignment: address: IdentifierExpression[~victim~0,] left hand side expression in assignment: address: IdentifierExpression[~#entry,] left hand side expression in assignment: lhs: VariableLHS[~probe_idx,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~map,],base],StructAccessExpression[IdentifierExpression[~map,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~rv~2,] left hand side expression in assignment: lhs: VariableLHS[~state~6,] left hand side expression in assignment: address: IdentifierExpression[~#probe_idx~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#new_entry~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#new_entry~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#entry~4,] left hand side expression in assignment: address: IdentifierExpression[~p_elem,] left hand side expression in assignment: address: IdentifierExpression[~was_created,] left hand side expression in assignment: lhs: VariableLHS[~was_created,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem1297,],base],StructAccessExpression[IdentifierExpression[#t~mem1297,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem1298,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem1298,],offset]]]] [2021-01-07 00:08:36,075 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,076 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~state,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[24],BinaryExpression[ARITHMOD,IdentifierExpression[~index~3,],IntegerLiteral[4294967296]]]]]] [2021-01-07 00:08:36,077 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~index~3,] [2021-01-07 00:08:36,077 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,078 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,078 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:08:36,079 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~was_present,] left hand side expression in assignment: address: IdentifierExpression[~p_value,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#iter~1,],base],StructAccessExpression[IdentifierExpression[~#iter~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#iter~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#iter~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~iter,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~iter,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~state~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~state~13,],offset]]]] [2021-01-07 00:08:36,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:08:37,282 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:08:37,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37 WrapperNode [2021-01-07 00:08:37,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:08:37,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:08:37,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:08:37,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:08:37,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:08:37,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:08:37,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:08:37,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:08:37,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... [2021-01-07 00:08:37,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:08:37,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:08:37,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:08:37,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:08:37,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:08:37,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-01-07 00:08:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:08:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:08:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:08:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:08:37,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:08:37,895 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-01-07 00:08:37,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:08:37,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:08:47,261 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !true; [2021-01-07 00:08:47,271 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:08:47,272 INFO L299 CfgBuilder]: Removed 118 assume(true) statements. [2021-01-07 00:08:47,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:08:47 BoogieIcfgContainer [2021-01-07 00:08:47,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:08:47,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:08:47,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:08:47,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:08:47,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:08:32" (1/3) ... [2021-01-07 00:08:47,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21675aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:08:47, skipping insertion in model container [2021-01-07 00:08:47,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:08:37" (2/3) ... [2021-01-07 00:08:47,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21675aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:08:47, skipping insertion in model container [2021-01-07 00:08:47,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:08:47" (3/3) ... [2021-01-07 00:08:47,283 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_unbounded_harness.i [2021-01-07 00:08:47,290 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:08:47,296 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-07 00:08:47,317 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-07 00:08:47,348 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:08:47,348 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:08:47,348 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:08:47,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:08:47,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:08:47,349 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:08:47,349 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:08:47,349 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:08:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2021-01-07 00:08:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 00:08:47,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:47,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:47,378 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1956444402, now seen corresponding path program 1 times [2021-01-07 00:08:47,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:47,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123113759] [2021-01-07 00:08:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:48,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123113759] [2021-01-07 00:08:48,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:48,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:08:48,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110219665] [2021-01-07 00:08:48,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:08:48,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:08:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:08:48,343 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2021-01-07 00:08:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:48,420 INFO L93 Difference]: Finished difference Result 221 states and 294 transitions. [2021-01-07 00:08:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:08:48,422 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2021-01-07 00:08:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:48,440 INFO L225 Difference]: With dead ends: 221 [2021-01-07 00:08:48,440 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 00:08:48,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:08:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 00:08:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-01-07 00:08:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-01-07 00:08:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2021-01-07 00:08:48,528 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 31 [2021-01-07 00:08:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:48,528 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2021-01-07 00:08:48,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:08:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2021-01-07 00:08:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 00:08:48,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:48,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:48,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:08:48,535 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1279980632, now seen corresponding path program 1 times [2021-01-07 00:08:48,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:48,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163078853] [2021-01-07 00:08:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:49,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163078853] [2021-01-07 00:08:49,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:49,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:49,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689156444] [2021-01-07 00:08:49,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:49,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:49,064 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 4 states. [2021-01-07 00:08:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:49,247 INFO L93 Difference]: Finished difference Result 272 states and 333 transitions. [2021-01-07 00:08:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:49,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-07 00:08:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:49,253 INFO L225 Difference]: With dead ends: 272 [2021-01-07 00:08:49,253 INFO L226 Difference]: Without dead ends: 191 [2021-01-07 00:08:49,257 INFO L677 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 [2021-01-07 00:08:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-07 00:08:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 108. [2021-01-07 00:08:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:08:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2021-01-07 00:08:49,287 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 31 [2021-01-07 00:08:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:49,288 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2021-01-07 00:08:49,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2021-01-07 00:08:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 00:08:49,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:49,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:49,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:08:49,291 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:49,292 INFO L82 PathProgramCache]: Analyzing trace with hash 422969666, now seen corresponding path program 1 times [2021-01-07 00:08:49,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:49,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693799580] [2021-01-07 00:08:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:49,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693799580] [2021-01-07 00:08:49,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:49,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:49,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999528946] [2021-01-07 00:08:49,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:49,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:49,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:49,710 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 4 states. [2021-01-07 00:08:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:49,830 INFO L93 Difference]: Finished difference Result 202 states and 245 transitions. [2021-01-07 00:08:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:49,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2021-01-07 00:08:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:49,833 INFO L225 Difference]: With dead ends: 202 [2021-01-07 00:08:49,833 INFO L226 Difference]: Without dead ends: 189 [2021-01-07 00:08:49,834 INFO L677 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 [2021-01-07 00:08:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-07 00:08:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 110. [2021-01-07 00:08:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-01-07 00:08:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2021-01-07 00:08:49,844 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 33 [2021-01-07 00:08:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:49,844 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2021-01-07 00:08:49,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2021-01-07 00:08:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 00:08:49,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:49,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:49,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:08:49,847 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1472200601, now seen corresponding path program 1 times [2021-01-07 00:08:49,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:49,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659977666] [2021-01-07 00:08:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:50,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659977666] [2021-01-07 00:08:50,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:50,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:50,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341613040] [2021-01-07 00:08:50,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:50,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:50,239 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand 4 states. [2021-01-07 00:08:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:50,272 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2021-01-07 00:08:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:50,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2021-01-07 00:08:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:50,275 INFO L225 Difference]: With dead ends: 123 [2021-01-07 00:08:50,276 INFO L226 Difference]: Without dead ends: 110 [2021-01-07 00:08:50,276 INFO L677 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 [2021-01-07 00:08:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-01-07 00:08:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-01-07 00:08:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:08:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2021-01-07 00:08:50,284 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 34 [2021-01-07 00:08:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:50,284 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2021-01-07 00:08:50,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2021-01-07 00:08:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 00:08:50,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:50,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:50,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:08:50,287 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1643067430, now seen corresponding path program 1 times [2021-01-07 00:08:50,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:50,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26019119] [2021-01-07 00:08:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:50,425 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:50,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620879231] [2021-01-07 00:08:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 00:08:51,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:51,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26019119] [2021-01-07 00:08:51,793 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:51,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620879231] [2021-01-07 00:08:51,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:51,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:51,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004193447] [2021-01-07 00:08:51,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:51,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:51,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:51,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:51,795 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand 4 states. [2021-01-07 00:08:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:52,080 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2021-01-07 00:08:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:52,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2021-01-07 00:08:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:52,082 INFO L225 Difference]: With dead ends: 136 [2021-01-07 00:08:52,082 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 00:08:52,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 00:08:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-01-07 00:08:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:08:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2021-01-07 00:08:52,090 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 41 [2021-01-07 00:08:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:52,090 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2021-01-07 00:08:52,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2021-01-07 00:08:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 00:08:52,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:52,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:52,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:52,308 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1803411465, now seen corresponding path program 1 times [2021-01-07 00:08:52,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:52,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700943086] [2021-01-07 00:08:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:52,439 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:52,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233955190] [2021-01-07 00:08:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:53,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 2601 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:08:53,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:53,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700943086] [2021-01-07 00:08:53,839 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:53,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233955190] [2021-01-07 00:08:53,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:53,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:53,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130101630] [2021-01-07 00:08:53,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:53,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:53,841 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand 4 states. [2021-01-07 00:08:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:53,872 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2021-01-07 00:08:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:53,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2021-01-07 00:08:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:53,874 INFO L225 Difference]: With dead ends: 173 [2021-01-07 00:08:53,874 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 00:08:53,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 00:08:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-01-07 00:08:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:08:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-01-07 00:08:53,880 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 54 [2021-01-07 00:08:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:53,881 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-01-07 00:08:53,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-01-07 00:08:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-07 00:08:53,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:53,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:54,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:54,097 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1242582774, now seen corresponding path program 1 times [2021-01-07 00:08:54,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:54,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448596288] [2021-01-07 00:08:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:54,208 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:54,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332628244] [2021-01-07 00:08:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:55,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:08:55,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:55,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448596288] [2021-01-07 00:08:55,381 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:55,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332628244] [2021-01-07 00:08:55,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:55,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:55,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379150085] [2021-01-07 00:08:55,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:55,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:55,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:55,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:55,384 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 4 states. [2021-01-07 00:08:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:55,701 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2021-01-07 00:08:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:08:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-07 00:08:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:55,706 INFO L225 Difference]: With dead ends: 138 [2021-01-07 00:08:55,706 INFO L226 Difference]: Without dead ends: 108 [2021-01-07 00:08:55,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-01-07 00:08:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-01-07 00:08:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:08:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2021-01-07 00:08:55,713 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 59 [2021-01-07 00:08:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:55,713 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2021-01-07 00:08:55,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2021-01-07 00:08:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 00:08:55,715 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:55,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:55,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:55,927 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash -231511021, now seen corresponding path program 1 times [2021-01-07 00:08:55,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:55,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860001269] [2021-01-07 00:08:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:56,067 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:56,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394366524] [2021-01-07 00:08:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:57,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 00:08:57,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:57,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860001269] [2021-01-07 00:08:57,457 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:57,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394366524] [2021-01-07 00:08:57,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:57,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:08:57,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325835535] [2021-01-07 00:08:57,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:08:57,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:08:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:08:57,467 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 9 states. [2021-01-07 00:08:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:58,175 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2021-01-07 00:08:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:08:58,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2021-01-07 00:08:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:58,177 INFO L225 Difference]: With dead ends: 150 [2021-01-07 00:08:58,177 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 00:08:58,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-01-07 00:08:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 00:08:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-01-07 00:08:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-01-07 00:08:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2021-01-07 00:08:58,182 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 65 [2021-01-07 00:08:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:58,182 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2021-01-07 00:08:58,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:08:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2021-01-07 00:08:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 00:08:58,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:58,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:58,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:58,385 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash -961600890, now seen corresponding path program 1 times [2021-01-07 00:08:58,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:58,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047883905] [2021-01-07 00:08:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:58,498 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:08:58,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384881421] [2021-01-07 00:08:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:59,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 2823 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-07 00:08:59,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:59,815 INFO L382 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 [2021-01-07 00:08:59,816 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:59,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:59,825 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:08:59,826 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2021-01-07 00:08:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:59,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047883905] [2021-01-07 00:08:59,936 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:08:59,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384881421] [2021-01-07 00:08:59,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:59,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-07 00:08:59,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990306762] [2021-01-07 00:08:59,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 00:08:59,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 00:08:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-01-07 00:08:59,938 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 14 states. [2021-01-07 00:09:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:06,438 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2021-01-07 00:09:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 00:09:06,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2021-01-07 00:09:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:06,440 INFO L225 Difference]: With dead ends: 131 [2021-01-07 00:09:06,440 INFO L226 Difference]: Without dead ends: 112 [2021-01-07 00:09:06,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2021-01-07 00:09:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-01-07 00:09:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2021-01-07 00:09:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-01-07 00:09:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2021-01-07 00:09:06,452 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 75 [2021-01-07 00:09:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:06,453 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2021-01-07 00:09:06,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 00:09:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2021-01-07 00:09:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 00:09:06,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:06,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:09:06,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:06,671 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash 813406472, now seen corresponding path program 1 times [2021-01-07 00:09:06,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:06,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866542191] [2021-01-07 00:09:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:06,791 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:09:06,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778464144] [2021-01-07 00:09:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:08,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 2818 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:09:08,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:09:08,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:08,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866542191] [2021-01-07 00:09:08,184 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:09:08,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778464144] [2021-01-07 00:09:08,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:08,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:09:08,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314085568] [2021-01-07 00:09:08,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:09:08,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:09:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:09:08,187 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 5 states. [2021-01-07 00:09:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:08,459 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2021-01-07 00:09:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:09:08,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-07 00:09:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:08,462 INFO L225 Difference]: With dead ends: 130 [2021-01-07 00:09:08,462 INFO L226 Difference]: Without dead ends: 106 [2021-01-07 00:09:08,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:09:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-01-07 00:09:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-01-07 00:09:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2021-01-07 00:09:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-01-07 00:09:08,473 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 75 [2021-01-07 00:09:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:08,473 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-01-07 00:09:08,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:09:08,473 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-01-07 00:09:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-07 00:09:08,475 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:08,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:09:08,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:08,690 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2145069215, now seen corresponding path program 1 times [2021-01-07 00:09:08,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:08,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76559642] [2021-01-07 00:09:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:08,827 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:09:08,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48877254] [2021-01-07 00:09:08,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:10,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 00:09:10,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:09:10,134 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:10,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:10,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:09:10,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:09:10,223 INFO L382 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 16 treesize of output 8 [2021-01-07 00:09:10,225 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:10,236 INFO L382 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 7 treesize of output 3 [2021-01-07 00:09:10,245 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:10,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:10,280 INFO L382 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 7 treesize of output 3 [2021-01-07 00:09:10,285 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:10,291 INFO L382 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 16 treesize of output 8 [2021-01-07 00:09:10,294 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:09:10,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:09:10,308 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 00:09:10,308 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2021-01-07 00:09:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:10,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76559642] [2021-01-07 00:09:10,335 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:09:10,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48877254] [2021-01-07 00:09:10,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:10,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:09:10,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826619205] [2021-01-07 00:09:10,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:09:10,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:09:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:09:10,338 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 5 states. [2021-01-07 00:09:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:15,446 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-01-07 00:09:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:09:15,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-07 00:09:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:15,449 INFO L225 Difference]: With dead ends: 139 [2021-01-07 00:09:15,449 INFO L226 Difference]: Without dead ends: 119 [2021-01-07 00:09:15,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:09:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-01-07 00:09:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-01-07 00:09:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-07 00:09:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2021-01-07 00:09:15,457 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 77 [2021-01-07 00:09:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:15,458 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2021-01-07 00:09:15,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:09:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2021-01-07 00:09:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 00:09:15,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:15,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:09:15,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:09:15,673 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash -358643470, now seen corresponding path program 1 times [2021-01-07 00:09:15,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:15,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392643727] [2021-01-07 00:09:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:15,784 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:09:15,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147716084] [2021-01-07 00:09:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:12:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 2869 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 00:12:43,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:12:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:12:43,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392643727] [2021-01-07 00:12:43,963 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:43,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147716084] [2021-01-07 00:12:43,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:43,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:12:43,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244022864] [2021-01-07 00:12:43,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:12:43,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:12:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:12:43,965 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 4 states. [2021-01-07 00:12:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:44,105 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2021-01-07 00:12:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:12:44,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 00:12:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:44,107 INFO L225 Difference]: With dead ends: 286 [2021-01-07 00:12:44,108 INFO L226 Difference]: Without dead ends: 200 [2021-01-07 00:12:44,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:12:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-01-07 00:12:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 112. [2021-01-07 00:12:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-07 00:12:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2021-01-07 00:12:44,116 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 78 [2021-01-07 00:12:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:44,117 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2021-01-07 00:12:44,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:12:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2021-01-07 00:12:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 00:12:44,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:12:44,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2021-01-07 00:12:44,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 00:12:44,332 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:12:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:12:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -776040076, now seen corresponding path program 1 times [2021-01-07 00:12:44,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:12:44,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173728629] [2021-01-07 00:12:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:12:44,479 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:12:44,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493371922] [2021-01-07 00:12:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:12:45,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 2867 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-07 00:12:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:12:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:12:45,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173728629] [2021-01-07 00:12:45,716 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:45,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493371922] [2021-01-07 00:12:45,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:45,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:12:45,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333253061] [2021-01-07 00:12:45,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:12:45,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:12:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:12:45,717 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 4 states. [2021-01-07 00:12:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:45,796 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2021-01-07 00:12:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:12:45,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 00:12:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:45,798 INFO L225 Difference]: With dead ends: 196 [2021-01-07 00:12:45,798 INFO L226 Difference]: Without dead ends: 110 [2021-01-07 00:12:45,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:12:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-01-07 00:12:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2021-01-07 00:12:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 00:12:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2021-01-07 00:12:45,809 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 78 [2021-01-07 00:12:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:45,809 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2021-01-07 00:12:45,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:12:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2021-01-07 00:12:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 00:12:45,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:12:45,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:12:46,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:46,025 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:12:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:12:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -589599749, now seen corresponding path program 1 times [2021-01-07 00:12:46,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:12:46,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103480296] [2021-01-07 00:12:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:12:46,136 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:12:46,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404066605] [2021-01-07 00:12:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:12:47,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:12:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:12:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:12:47,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103480296] [2021-01-07 00:12:47,320 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:47,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404066605] [2021-01-07 00:12:47,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:47,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:12:47,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649189537] [2021-01-07 00:12:47,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:12:47,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:12:47,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:12:47,322 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 4 states. [2021-01-07 00:12:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:47,495 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2021-01-07 00:12:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:12:47,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-07 00:12:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:47,501 INFO L225 Difference]: With dead ends: 189 [2021-01-07 00:12:47,501 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 00:12:47,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:12:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 00:12:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-01-07 00:12:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 00:12:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-01-07 00:12:47,512 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 79 [2021-01-07 00:12:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:47,512 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-01-07 00:12:47,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:12:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-01-07 00:12:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 00:12:47,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:12:47,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:12:47,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:47,727 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:12:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:12:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -658597663, now seen corresponding path program 1 times [2021-01-07 00:12:47,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:12:47,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517216175] [2021-01-07 00:12:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:12:47,840 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:12:47,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84753230] [2021-01-07 00:12:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:12:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:12:48,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 2879 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 00:12:48,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:12:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:12:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517216175] [2021-01-07 00:12:49,041 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84753230] [2021-01-07 00:12:49,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:49,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:12:49,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641285385] [2021-01-07 00:12:49,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:12:49,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:12:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:12:49,045 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 5 states. [2021-01-07 00:12:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:49,145 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-01-07 00:12:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:12:49,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-07 00:12:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:49,146 INFO L225 Difference]: With dead ends: 107 [2021-01-07 00:12:49,146 INFO L226 Difference]: Without dead ends: 0 [2021-01-07 00:12:49,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:12:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-07 00:12:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-07 00:12:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-07 00:12:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-07 00:12:49,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2021-01-07 00:12:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:49,147 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-07 00:12:49,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:12:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-07 00:12:49,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-07 00:12:49,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 00:12:49,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-07 00:12:49,577 INFO L189 CegarLoopUtils]: For program point L10143-2(lines 10143 10145) no Hoare annotation was computed. [2021-01-07 00:12:49,577 INFO L189 CegarLoopUtils]: For program point L10143(lines 10143 10145) no Hoare annotation was computed. [2021-01-07 00:12:49,577 INFO L185 CegarLoopUtils]: At program point L250(lines 248 251) the Hoare annotation is: false [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385-5(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point L7385-4(lines 7385 7387) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-07 00:12:49,578 INFO L185 CegarLoopUtils]: At program point L6940(lines 6934 6941) the Hoare annotation is: false [2021-01-07 00:12:49,578 INFO L185 CegarLoopUtils]: At program point L10062-1(lines 10017 10064) the Hoare annotation is: false [2021-01-07 00:12:49,578 INFO L185 CegarLoopUtils]: At program point L10062(lines 10017 10064) the Hoare annotation is: false [2021-01-07 00:12:49,578 INFO L185 CegarLoopUtils]: At program point L9220(lines 9220 9261) the Hoare annotation is: (<= (+ |ULTIMATE.start_aws_hash_table_init_#res| 1) 0) [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L2630(lines 2626 2631) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L2498-2(lines 2498 2499) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L10130(lines 10119 10131) the Hoare annotation is: (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L9189(lines 9171 9190) the Hoare annotation is: (and (= |ULTIMATE.start_s_alloc_state_#res.base| 0) (= |ULTIMATE.start_s_alloc_state_#res.offset| 0)) [2021-01-07 00:12:49,579 INFO L192 CegarLoopUtils]: At program point L10147(line 10147) the Hoare annotation is: true [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L9173(lines 9173 9177) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L7010(lines 7010 7014) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L2501(lines 2497 2502) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L189 CegarLoopUtils]: For program point L9256(lines 9256 9258) no Hoare annotation was computed. [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L2501-2(lines 2497 2502) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L255(lines 253 256) the Hoare annotation is: false [2021-01-07 00:12:49,579 INFO L185 CegarLoopUtils]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L185 CegarLoopUtils]: At program point L255-2(lines 253 256) the Hoare annotation is: false [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L185 CegarLoopUtils]: At program point L2617(lines 2613 2621) the Hoare annotation is: false [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L10132(lines 10132 10146) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L223(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L10019-1(lines 10019 10023) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2021-01-07 00:12:49,580 INFO L185 CegarLoopUtils]: At program point L9260-2(line 9260) the Hoare annotation is: false [2021-01-07 00:12:49,580 INFO L189 CegarLoopUtils]: For program point L9260-3(line 9260) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,581 INFO L189 CegarLoopUtils]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,582 INFO L189 CegarLoopUtils]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,583 INFO L189 CegarLoopUtils]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L261(line 261) the Hoare annotation is: false [2021-01-07 00:12:49,583 INFO L189 CegarLoopUtils]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,583 INFO L189 CegarLoopUtils]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L2590(lines 2586 2594) the Hoare annotation is: false [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L2590-2(lines 2586 2594) the Hoare annotation is: false [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-01-07 00:12:49,583 INFO L189 CegarLoopUtils]: For program point L10122(lines 10122 10124) no Hoare annotation was computed. [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: false [2021-01-07 00:12:49,583 INFO L185 CegarLoopUtils]: At program point L6951(lines 6950 6952) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2021-01-07 00:12:49,584 INFO L185 CegarLoopUtils]: At program point L2657(lines 2637 2658) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= 2 (mod ULTIMATE.start_s_update_template_size_~min_size~0 4294967296)) (< 1 ULTIMATE.start_aws_hash_table_init_~map.base) (<= 2 (mod ULTIMATE.start_aws_round_up_to_power_of_two_~n 4294967296)) (< 0 |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_aws_round_up_to_power_of_two_#res| 1) 0)) [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-01-07 00:12:49,584 INFO L189 CegarLoopUtils]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L185 CegarLoopUtils]: At program point L10008-6(lines 10006 10009) the Hoare annotation is: false [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,585 INFO L189 CegarLoopUtils]: For program point L10008-12(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L10008-13(lines 10006 10009) the Hoare annotation is: false [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= 2 (mod ULTIMATE.start_s_update_template_size_~min_size~0 4294967296)) (< 1 ULTIMATE.start_aws_hash_table_init_~map.base) (<= 2 (mod ULTIMATE.start_aws_round_up_to_power_of_two_~n 4294967296)) (< 0 |#StackHeapBarrier|)) [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: false [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L6986(lines 6984 6987) the Hoare annotation is: false [2021-01-07 00:12:49,586 INFO L189 CegarLoopUtils]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-01-07 00:12:49,586 INFO L185 CegarLoopUtils]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-01-07 00:12:49,586 INFO L189 CegarLoopUtils]: For program point L10008-9(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,587 INFO L185 CegarLoopUtils]: At program point L1998-4(lines 1988 1999) the Hoare annotation is: false [2021-01-07 00:12:49,587 INFO L189 CegarLoopUtils]: For program point L10008-10(line 10008) no Hoare annotation was computed. [2021-01-07 00:12:49,587 INFO L185 CegarLoopUtils]: At program point L1998-5(lines 1988 1999) the Hoare annotation is: (and (= ULTIMATE.start_aws_mem_calloc_~mem~1.base 0) (= ULTIMATE.start_aws_mem_calloc_~mem~1.offset 0)) [2021-01-07 00:12:49,588 INFO L185 CegarLoopUtils]: At program point L7020(lines 7001 7021) the Hoare annotation is: (and (= |ULTIMATE.start_aws_mem_calloc_#res.offset| 0) (= |ULTIMATE.start_aws_mem_calloc_#res.base| 0)) [2021-01-07 00:12:49,588 INFO L185 CegarLoopUtils]: At program point L9217(lines 9193 9218) the Hoare annotation is: (and (<= 2 (mod ULTIMATE.start_s_update_template_size_~min_size~0 4294967296)) (< 1 ULTIMATE.start_aws_hash_table_init_~map.base) (<= (+ |ULTIMATE.start_s_update_template_size_#res| 1) 0) (<= 2 (mod ULTIMATE.start_aws_round_up_to_power_of_two_~n 4294967296)) (< 0 |#StackHeapBarrier|)) [2021-01-07 00:12:49,588 INFO L185 CegarLoopUtils]: At program point L2545(lines 2541 2546) the Hoare annotation is: false [2021-01-07 00:12:49,589 INFO L189 CegarLoopUtils]: For program point L6955(lines 6955 6957) no Hoare annotation was computed. [2021-01-07 00:12:49,589 INFO L189 CegarLoopUtils]: For program point L10126(lines 10126 10128) no Hoare annotation was computed. [2021-01-07 00:12:49,589 INFO L189 CegarLoopUtils]: For program point L9251(lines 9251 9253) no Hoare annotation was computed. [2021-01-07 00:12:49,589 INFO L185 CegarLoopUtils]: At program point L6955-3(lines 6954 6958) the Hoare annotation is: (and (= |ULTIMATE.start_can_fail_calloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_calloc_#res.base| 0)) [2021-01-07 00:12:49,589 INFO L189 CegarLoopUtils]: For program point L6955-2(lines 6955 6957) no Hoare annotation was computed. [2021-01-07 00:12:49,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 12:12:49 BoogieIcfgContainer [2021-01-07 00:12:49,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-07 00:12:49,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-07 00:12:49,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-07 00:12:49,628 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-07 00:12:49,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:08:47" (3/4) ... [2021-01-07 00:12:49,634 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-07 00:12:49,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 188 nodes and edges [2021-01-07 00:12:49,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2021-01-07 00:12:49,680 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-01-07 00:12:49,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-01-07 00:12:49,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-01-07 00:12:49,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-01-07 00:12:49,687 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-07 00:12:49,689 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-07 00:12:49,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result + 1 <= 0 && 2 <= min_size % 4294967296) && 1 < map) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown) && \result + 1 <= 0 [2021-01-07 00:12:49,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= min_size % 4294967296 && 1 < map) && \result + 1 <= 0) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown [2021-01-07 00:12:49,742 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= 0 && 2 <= min_size % 4294967296) && 1 < map) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown [2021-01-07 00:12:49,743 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result + 1 <= 0 [2021-01-07 00:12:49,747 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result + 1 <= 0 [2021-01-07 00:12:49,747 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 && \result == 0 [2021-01-07 00:12:49,748 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 && \result == 0 [2021-01-07 00:12:49,748 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 && \result == 0 [2021-01-07 00:12:51,203 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/aws-c-common/aws_hash_table_init_unbounded_harness.i-witness.graphml [2021-01-07 00:12:51,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-07 00:12:51,205 INFO L168 Benchmark]: Toolchain (without parser) took 259192.63 ms. Allocated memory was 151.0 MB in the beginning and 856.7 MB in the end (delta: 705.7 MB). Free memory was 117.1 MB in the beginning and 540.2 MB in the end (delta: -423.0 MB). Peak memory consumption was 568.2 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,205 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-07 00:12:51,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 5266.82 ms. Allocated memory was 151.0 MB in the beginning and 202.4 MB in the end (delta: 51.4 MB). Free memory was 117.0 MB in the beginning and 107.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 112.3 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 294.82 ms. Allocated memory is still 202.4 MB. Free memory was 107.9 MB in the beginning and 94.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,207 INFO L168 Benchmark]: Boogie Preprocessor took 198.77 ms. Allocated memory is still 202.4 MB. Free memory was 94.3 MB in the beginning and 85.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,207 INFO L168 Benchmark]: RCFGBuilder took 9493.03 ms. Allocated memory was 202.4 MB in the beginning and 440.4 MB in the end (delta: 238.0 MB). Free memory was 84.8 MB in the beginning and 331.9 MB in the end (delta: -247.1 MB). Peak memory consumption was 206.2 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,207 INFO L168 Benchmark]: TraceAbstraction took 242351.33 ms. Allocated memory was 440.4 MB in the beginning and 856.7 MB in the end (delta: 416.3 MB). Free memory was 331.4 MB in the beginning and 308.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 439.8 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,208 INFO L168 Benchmark]: Witness Printer took 1575.87 ms. Allocated memory is still 856.7 MB. Free memory was 308.4 MB in the beginning and 540.2 MB in the end (delta: -231.7 MB). Peak memory consumption was 53.0 MB. Max. memory is 8.0 GB. [2021-01-07 00:12:51,210 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 5266.82 ms. Allocated memory was 151.0 MB in the beginning and 202.4 MB in the end (delta: 51.4 MB). Free memory was 117.0 MB in the beginning and 107.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 112.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 294.82 ms. Allocated memory is still 202.4 MB. Free memory was 107.9 MB in the beginning and 94.3 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 198.77 ms. Allocated memory is still 202.4 MB. Free memory was 94.3 MB in the beginning and 85.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * RCFGBuilder took 9493.03 ms. Allocated memory was 202.4 MB in the beginning and 440.4 MB in the end (delta: 238.0 MB). Free memory was 84.8 MB in the beginning and 331.9 MB in the end (delta: -247.1 MB). Peak memory consumption was 206.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 242351.33 ms. Allocated memory was 440.4 MB in the beginning and 856.7 MB in the end (delta: 416.3 MB). Free memory was 331.4 MB in the beginning and 308.4 MB in the end (delta: 23.0 MB). Peak memory consumption was 439.8 MB. Max. memory is 8.0 GB. * Witness Printer took 1575.87 ms. Allocated memory is still 856.7 MB. Free memory was 308.4 MB in the beginning and 540.2 MB in the end (delta: -231.7 MB). Peak memory consumption was 53.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((\result + 1 <= 0 && 2 <= min_size % 4294967296) && 1 < map) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9193]: Loop Invariant Derived loop invariant: (((2 <= min_size % 4294967296 && 1 < map) && \result + 1 <= 0) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6984]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10119]: Loop Invariant Derived loop invariant: \result + 1 <= 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: \result == 0 && \result == 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9260]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: ((((\result + 1 <= 0 && 2 <= min_size % 4294967296) && 1 < map) && 2 <= n % 4294967296) && 0 < unknown-#StackHeapBarrier-unknown) && \result + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9220]: Loop Invariant Derived loop invariant: \result + 1 <= 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10147]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9171]: Loop Invariant Derived loop invariant: \result == 0 && \result == 0 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: mem == 0 && mem == 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6954]: Loop Invariant Derived loop invariant: \result == 0 && \result == 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 242.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1780 SDtfs, 1178 SDslu, 4151 SDs, 0 SdLazy, 368 SolverSat, 27 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 269 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 38 PreInvPairs, 51 NumberOfFragments, 140 HoareAnnotationTreeSize, 38 FomulaSimplifications, 92 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 217.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 84092 SizeOfPredicates, 73 NumberOfNonLiveVariables, 30373 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...