/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_priority_queue_clean_up_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:16:16,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:16:16,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:16:16,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:16:16,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:16:16,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:16:16,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:16:16,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:16:16,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:16:16,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:16:16,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:16:16,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:16:16,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:16:16,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:16:16,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:16:16,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:16:16,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:16:16,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:16:16,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:16:16,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:16:16,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:16:16,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:16:16,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:16:16,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:16:16,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:16:16,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:16:16,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:16:16,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:16:16,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:16:16,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:16:16,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:16:16,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:16:16,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:16:16,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:16:16,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:16:16,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:16:16,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:16:16,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:16:16,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:16:16,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:16:16,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:16:16,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:16:16,894 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:16:16,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:16:16,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:16:16,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:16:16,899 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:16:16,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:16:16,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:16:16,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:16:16,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:16:16,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:16:16,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:16:16,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:16:16,901 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:16:16,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:16:16,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:16:16,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:16:16,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:16:16,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:16:16,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:16:16,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:16:16,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:16:16,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:16:16,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:16:16,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:16:16,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:16:16,904 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 [2020-12-23 14:16:17,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:16:17,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:16:17,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:16:17,385 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:16:17,385 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:16:17,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2020-12-23 14:16:17,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8dcc9904b/8846bf3b218e443bbc987d67bf596752/FLAGbb20408f1 [2020-12-23 14:16:18,563 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:16:18,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2020-12-23 14:16:18,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8dcc9904b/8846bf3b218e443bbc987d67bf596752/FLAGbb20408f1 [2020-12-23 14:16:18,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8dcc9904b/8846bf3b218e443bbc987d67bf596752 [2020-12-23 14:16:18,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:16:18,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:16:18,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:16:18,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:16:18,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:16:18,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:16:18" (1/1) ... [2020-12-23 14:16:18,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6fbbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:18, skipping insertion in model container [2020-12-23 14:16:18,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:16:18" (1/1) ... [2020-12-23 14:16:19,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:16:19,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 14:16:19,435 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_priority_queue_clean_up_harness.i[4501,4514] [2020-12-23 14:16:19,443 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_priority_queue_clean_up_harness.i[4561,4574] [2020-12-23 14:16:19,468 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:16:19,475 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,] [2020-12-23 14:16:20,393 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[~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]]]] [2020-12-23 14:16:20,488 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,489 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,490 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,491 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,492 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,] [2020-12-23 14:16:20,508 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,509 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,511 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:20,512 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] 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~mem348,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem348,],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~mem359,],base],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem360,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem360,],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~mem371,],base],StructAccessExpression[IdentifierExpression[#t~mem371,],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~mem378,],base],StructAccessExpression[IdentifierExpression[#t~mem378,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem380,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem380,],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~mem424,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem424,],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~mem426,],base],StructAccessExpression[IdentifierExpression[#t~mem426,],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~mem427,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem427,],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~mem428,],base],StructAccessExpression[IdentifierExpression[#t~mem428,],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]]] [2020-12-23 14:16:20,900 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:16:20,901 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:16:20,902 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:16:20,904 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:16:20,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:16:20,906 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:16:20,907 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:16:20,908 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:16:20,909 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:16:20,909 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[#t~mem551,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem551,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem554,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem554,],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]]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] 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[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2020-12-23 14:16:21,056 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,056 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:16:21,202 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 14:16:21,220 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_priority_queue_clean_up_harness.i[4501,4514] [2020-12-23 14:16:21,221 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_priority_queue_clean_up_harness.i[4561,4574] [2020-12-23 14:16:21,223 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:16:21,225 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,] [2020-12-23 14:16:21,263 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[~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]]]] [2020-12-23 14:16:21,281 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,282 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,282 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,283 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,284 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,] [2020-12-23 14:16:21,292 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,293 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,294 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,295 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] 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~mem362,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem362,],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~mem373,],base],StructAccessExpression[IdentifierExpression[#t~mem373,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem374,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem375,],base],StructAccessExpression[IdentifierExpression[#t~mem375,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem376,],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~mem389,],base],StructAccessExpression[IdentifierExpression[#t~mem389,],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~mem396,],base],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem398,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem398,],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~mem442,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem442,],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~mem444,],base],StructAccessExpression[IdentifierExpression[#t~mem444,],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~mem445,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem445,],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~mem446,],base],StructAccessExpression[IdentifierExpression[#t~mem446,],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]]] [2020-12-23 14:16:21,372 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:16:21,374 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:16:21,376 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:16:21,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:16:21,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:16:21,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:16:21,380 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:16:21,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:16:21,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:16:21,382 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[#t~mem569,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem569,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem572,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem572,],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]]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] 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[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2020-12-23 14:16:21,457 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,460 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:21,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:16:22,499 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:16:22,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22 WrapperNode [2020-12-23 14:16:22,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:16:22,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:16:22,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:16:22,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:16:22,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:16:22,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:16:22,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:16:22,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:16:22,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (1/1) ... [2020-12-23 14:16:22,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:16:22,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:16:22,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:16:22,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:16:22,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (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 [2020-12-23 14:16:22,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:16:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:16:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:16:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:16:22,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:16:22,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:16:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:16:32,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:16:32,751 INFO L299 CfgBuilder]: Removed 160 assume(true) statements. [2020-12-23 14:16:32,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:16:32 BoogieIcfgContainer [2020-12-23 14:16:32,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:16:32,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:16:32,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:16:32,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:16:32,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:16:18" (1/3) ... [2020-12-23 14:16:32,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9328e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:16:32, skipping insertion in model container [2020-12-23 14:16:32,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:22" (2/3) ... [2020-12-23 14:16:32,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9328e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:16:32, skipping insertion in model container [2020-12-23 14:16:32,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:16:32" (3/3) ... [2020-12-23 14:16:32,762 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness.i [2020-12-23 14:16:32,769 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:16:32,776 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 14:16:32,797 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 14:16:32,828 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:16:32,828 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:16:32,828 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:16:32,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:16:32,829 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:16:32,829 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:16:32,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:16:32,829 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:16:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2020-12-23 14:16:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 14:16:32,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:32,862 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] [2020-12-23 14:16:32,863 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1087609144, now seen corresponding path program 1 times [2020-12-23 14:16:32,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:32,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489717522] [2020-12-23 14:16:32,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:33,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489717522] [2020-12-23 14:16:33,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:33,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:16:33,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012378289] [2020-12-23 14:16:33,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 14:16:33,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 14:16:33,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:16:33,762 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 2 states. [2020-12-23 14:16:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:33,840 INFO L93 Difference]: Finished difference Result 380 states and 549 transitions. [2020-12-23 14:16:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 14:16:33,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2020-12-23 14:16:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:33,853 INFO L225 Difference]: With dead ends: 380 [2020-12-23 14:16:33,853 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 14:16:33,857 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 [2020-12-23 14:16:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 14:16:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-12-23 14:16:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 14:16:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2020-12-23 14:16:33,913 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 45 [2020-12-23 14:16:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:33,913 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2020-12-23 14:16:33,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 14:16:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2020-12-23 14:16:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 14:16:33,917 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:33,917 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] [2020-12-23 14:16:33,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:16:33,918 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:33,919 INFO L82 PathProgramCache]: Analyzing trace with hash 339318222, now seen corresponding path program 1 times [2020-12-23 14:16:33,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:33,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282581860] [2020-12-23 14:16:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:34,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282581860] [2020-12-23 14:16:34,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:34,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:16:34,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542902289] [2020-12-23 14:16:34,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:16:34,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:16:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:16:34,385 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand 4 states. [2020-12-23 14:16:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:34,443 INFO L93 Difference]: Finished difference Result 296 states and 385 transitions. [2020-12-23 14:16:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:16:34,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-23 14:16:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:34,446 INFO L225 Difference]: With dead ends: 296 [2020-12-23 14:16:34,447 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 14:16:34,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:16:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 14:16:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-12-23 14:16:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 14:16:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-12-23 14:16:34,468 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-12-23 14:16:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:34,468 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-12-23 14:16:34,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:16:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-12-23 14:16:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 14:16:34,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:34,471 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] [2020-12-23 14:16:34,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:16:34,472 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 168473663, now seen corresponding path program 1 times [2020-12-23 14:16:34,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:34,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543603612] [2020-12-23 14:16:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:34,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543603612] [2020-12-23 14:16:34,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:34,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:16:34,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984213760] [2020-12-23 14:16:34,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:16:34,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:16:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:16:34,939 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 5 states. [2020-12-23 14:16:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:35,151 INFO L93 Difference]: Finished difference Result 409 states and 532 transitions. [2020-12-23 14:16:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:16:35,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-23 14:16:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:35,158 INFO L225 Difference]: With dead ends: 409 [2020-12-23 14:16:35,159 INFO L226 Difference]: Without dead ends: 269 [2020-12-23 14:16:35,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:16:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-23 14:16:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2020-12-23 14:16:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 14:16:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2020-12-23 14:16:35,210 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 55 [2020-12-23 14:16:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:35,211 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2020-12-23 14:16:35,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:16:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2020-12-23 14:16:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 14:16:35,213 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:35,214 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] [2020-12-23 14:16:35,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:16:35,217 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:35,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash -795727197, now seen corresponding path program 1 times [2020-12-23 14:16:35,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:35,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998584002] [2020-12-23 14:16:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:35,434 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:35,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578386497] [2020-12-23 14:16:35,435 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 [2020-12-23 14:16:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:36,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 14:16:36,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:36,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998584002] [2020-12-23 14:16:36,856 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:36,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578386497] [2020-12-23 14:16:36,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:36,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:16:36,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052662682] [2020-12-23 14:16:36,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:16:36,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:16:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:16:36,859 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand 6 states. [2020-12-23 14:16:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:36,999 INFO L93 Difference]: Finished difference Result 297 states and 384 transitions. [2020-12-23 14:16:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:16:37,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2020-12-23 14:16:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:37,001 INFO L225 Difference]: With dead ends: 297 [2020-12-23 14:16:37,002 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 14:16:37,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:16:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 14:16:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-12-23 14:16:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 14:16:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2020-12-23 14:16:37,017 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 63 [2020-12-23 14:16:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:37,017 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2020-12-23 14:16:37,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:16:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2020-12-23 14:16:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 14:16:37,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:37,020 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] [2020-12-23 14:16:37,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:37,234 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1514601710, now seen corresponding path program 1 times [2020-12-23 14:16:37,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:37,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918975549] [2020-12-23 14:16:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:37,371 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:37,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160985375] [2020-12-23 14:16:37,372 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 [2020-12-23 14:16:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:38,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 14:16:38,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:38,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918975549] [2020-12-23 14:16:38,620 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:38,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160985375] [2020-12-23 14:16:38,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:38,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:16:38,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846837371] [2020-12-23 14:16:38,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:16:38,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:16:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:16:38,624 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand 7 states. [2020-12-23 14:16:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:38,899 INFO L93 Difference]: Finished difference Result 384 states and 496 transitions. [2020-12-23 14:16:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:16:38,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2020-12-23 14:16:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:38,902 INFO L225 Difference]: With dead ends: 384 [2020-12-23 14:16:38,902 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 14:16:38,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-23 14:16:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 14:16:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 188. [2020-12-23 14:16:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 14:16:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2020-12-23 14:16:38,916 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 75 [2020-12-23 14:16:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:38,917 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2020-12-23 14:16:38,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:16:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2020-12-23 14:16:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 14:16:38,918 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:38,918 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, 1, 1] [2020-12-23 14:16:39,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:39,132 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:39,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 328015662, now seen corresponding path program 1 times [2020-12-23 14:16:39,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:39,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922877099] [2020-12-23 14:16:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:39,239 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:39,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841054204] [2020-12-23 14:16:39,240 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 [2020-12-23 14:16:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:40,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-23 14:16:40,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:40,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922877099] [2020-12-23 14:16:40,557 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:40,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841054204] [2020-12-23 14:16:40,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:40,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 14:16:40,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892198053] [2020-12-23 14:16:40,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:16:40,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:16:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:16:40,560 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand 7 states. [2020-12-23 14:16:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:41,079 INFO L93 Difference]: Finished difference Result 428 states and 547 transitions. [2020-12-23 14:16:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 14:16:41,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2020-12-23 14:16:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:41,083 INFO L225 Difference]: With dead ends: 428 [2020-12-23 14:16:41,083 INFO L226 Difference]: Without dead ends: 324 [2020-12-23 14:16:41,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-12-23 14:16:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-23 14:16:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 193. [2020-12-23 14:16:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-23 14:16:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2020-12-23 14:16:41,102 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 83 [2020-12-23 14:16:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:41,105 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2020-12-23 14:16:41,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:16:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2020-12-23 14:16:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 14:16:41,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:41,110 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, 1, 1] [2020-12-23 14:16:41,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:41,326 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash 329624376, now seen corresponding path program 1 times [2020-12-23 14:16:41,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:41,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994481809] [2020-12-23 14:16:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:41,462 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:41,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321413377] [2020-12-23 14:16:41,462 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 [2020-12-23 14:16:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:42,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 2702 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 14:16:42,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:42,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994481809] [2020-12-23 14:16:42,708 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:42,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321413377] [2020-12-23 14:16:42,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:42,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:16:42,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683204660] [2020-12-23 14:16:42,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:16:42,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:16:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:16:42,712 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand 4 states. [2020-12-23 14:16:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:42,792 INFO L93 Difference]: Finished difference Result 270 states and 340 transitions. [2020-12-23 14:16:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:16:42,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 14:16:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:42,795 INFO L225 Difference]: With dead ends: 270 [2020-12-23 14:16:42,795 INFO L226 Difference]: Without dead ends: 198 [2020-12-23 14:16:42,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:16:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-12-23 14:16:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2020-12-23 14:16:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-12-23 14:16:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2020-12-23 14:16:42,816 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 83 [2020-12-23 14:16:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:42,817 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2020-12-23 14:16:42,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:16:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2020-12-23 14:16:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:16:42,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:42,823 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, 1, 1, 1] [2020-12-23 14:16:43,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:43,031 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1669729280, now seen corresponding path program 1 times [2020-12-23 14:16:43,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:43,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093119048] [2020-12-23 14:16:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:43,143 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:43,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995683581] [2020-12-23 14:16:43,144 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 [2020-12-23 14:16:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:44,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 14:16:44,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:44,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093119048] [2020-12-23 14:16:44,314 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:44,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995683581] [2020-12-23 14:16:44,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:44,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 14:16:44,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502126299] [2020-12-23 14:16:44,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:16:44,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:16:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:16:44,318 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand 8 states. [2020-12-23 14:16:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:44,814 INFO L93 Difference]: Finished difference Result 440 states and 553 transitions. [2020-12-23 14:16:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 14:16:44,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 14:16:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:44,816 INFO L225 Difference]: With dead ends: 440 [2020-12-23 14:16:44,817 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 14:16:44,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-12-23 14:16:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 14:16:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 199. [2020-12-23 14:16:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-23 14:16:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 251 transitions. [2020-12-23 14:16:44,833 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 251 transitions. Word has length 84 [2020-12-23 14:16:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:44,833 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 251 transitions. [2020-12-23 14:16:44,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:16:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 251 transitions. [2020-12-23 14:16:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:16:44,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:44,834 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, 1, 1, 1] [2020-12-23 14:16:45,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:45,049 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1253430718, now seen corresponding path program 1 times [2020-12-23 14:16:45,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:45,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98422897] [2020-12-23 14:16:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:45,167 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:45,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024748101] [2020-12-23 14:16:45,168 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 [2020-12-23 14:16:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:46,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 14:16:46,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:46,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:16:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:46,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98422897] [2020-12-23 14:16:46,477 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:46,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024748101] [2020-12-23 14:16:46,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:46,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:16:46,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522476567] [2020-12-23 14:16:46,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:16:46,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:16:46,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:16:46,480 INFO L87 Difference]: Start difference. First operand 199 states and 251 transitions. Second operand 6 states. [2020-12-23 14:16:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:53,416 INFO L93 Difference]: Finished difference Result 456 states and 578 transitions. [2020-12-23 14:16:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:16:53,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2020-12-23 14:16:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:53,419 INFO L225 Difference]: With dead ends: 456 [2020-12-23 14:16:53,419 INFO L226 Difference]: Without dead ends: 332 [2020-12-23 14:16:53,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:16:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-12-23 14:16:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 203. [2020-12-23 14:16:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-12-23 14:16:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 256 transitions. [2020-12-23 14:16:53,436 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 256 transitions. Word has length 84 [2020-12-23 14:16:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:53,436 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 256 transitions. [2020-12-23 14:16:53,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:16:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 256 transitions. [2020-12-23 14:16:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:16:53,437 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:53,438 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, 1, 1, 1] [2020-12-23 14:16:53,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:16:53,652 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:53,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2012177280, now seen corresponding path program 1 times [2020-12-23 14:16:53,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:53,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530537205] [2020-12-23 14:16:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:53,775 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:53,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630712596] [2020-12-23 14:16:53,775 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 [2020-12-23 14:16:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:54,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 2711 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:16:54,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:54,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530537205] [2020-12-23 14:16:54,864 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:54,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630712596] [2020-12-23 14:16:54,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:54,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:16:54,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533567858] [2020-12-23 14:16:54,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:16:54,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:16:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:16:54,866 INFO L87 Difference]: Start difference. First operand 203 states and 256 transitions. Second operand 4 states. [2020-12-23 14:16:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:54,919 INFO L93 Difference]: Finished difference Result 335 states and 422 transitions. [2020-12-23 14:16:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:16:54,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 14:16:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:54,921 INFO L225 Difference]: With dead ends: 335 [2020-12-23 14:16:54,921 INFO L226 Difference]: Without dead ends: 211 [2020-12-23 14:16:54,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:16:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-12-23 14:16:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2020-12-23 14:16:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-23 14:16:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 260 transitions. [2020-12-23 14:16:54,936 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 260 transitions. Word has length 84 [2020-12-23 14:16:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:54,977 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 260 transitions. [2020-12-23 14:16:54,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:16:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2020-12-23 14:16:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:16:54,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:54,978 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, 1, 1, 1] [2020-12-23 14:16:55,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 14:16:55,181 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1617810494, now seen corresponding path program 1 times [2020-12-23 14:16:55,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:55,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462796905] [2020-12-23 14:16:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:55,299 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:55,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327212304] [2020-12-23 14:16:55,299 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 [2020-12-23 14:16:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:56,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-23 14:16:56,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:56,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462796905] [2020-12-23 14:16:56,536 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:56,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327212304] [2020-12-23 14:16:56,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:56,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 14:16:56,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910034790] [2020-12-23 14:16:56,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:16:56,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:16:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:16:56,538 INFO L87 Difference]: Start difference. First operand 207 states and 260 transitions. Second operand 8 states. [2020-12-23 14:16:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:16:57,020 INFO L93 Difference]: Finished difference Result 352 states and 435 transitions. [2020-12-23 14:16:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 14:16:57,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 14:16:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:16:57,022 INFO L225 Difference]: With dead ends: 352 [2020-12-23 14:16:57,022 INFO L226 Difference]: Without dead ends: 264 [2020-12-23 14:16:57,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-12-23 14:16:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-12-23 14:16:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 207. [2020-12-23 14:16:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-23 14:16:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2020-12-23 14:16:57,037 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 84 [2020-12-23 14:16:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:16:57,037 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2020-12-23 14:16:57,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:16:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2020-12-23 14:16:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:16:57,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:16:57,038 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, 1, 1, 1] [2020-12-23 14:16:57,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 14:16:57,249 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:16:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:16:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1230261128, now seen corresponding path program 1 times [2020-12-23 14:16:57,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:16:57,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054321520] [2020-12-23 14:16:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:16:57,357 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:16:57,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697907393] [2020-12-23 14:16:57,357 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 [2020-12-23 14:16:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:16:58,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 14:16:58,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:16:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:16:58,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054321520] [2020-12-23 14:16:58,809 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:16:58,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697907393] [2020-12-23 14:16:58,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:16:58,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:16:58,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115567385] [2020-12-23 14:16:58,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:16:58,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:16:58,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:16:58,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:16:58,811 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 9 states. [2020-12-23 14:17:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:01,848 INFO L93 Difference]: Finished difference Result 624 states and 774 transitions. [2020-12-23 14:17:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 14:17:01,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2020-12-23 14:17:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:01,852 INFO L225 Difference]: With dead ends: 624 [2020-12-23 14:17:01,853 INFO L226 Difference]: Without dead ends: 494 [2020-12-23 14:17:01,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-12-23 14:17:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-12-23 14:17:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 222. [2020-12-23 14:17:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-12-23 14:17:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2020-12-23 14:17:01,874 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 84 [2020-12-23 14:17:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:01,874 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2020-12-23 14:17:01,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:17:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2020-12-23 14:17:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:17:01,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:01,876 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, 1, 1, 1] [2020-12-23 14:17:02,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:02,091 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1392833590, now seen corresponding path program 1 times [2020-12-23 14:17:02,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:02,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538810233] [2020-12-23 14:17:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:02,184 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:02,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544936279] [2020-12-23 14:17:02,184 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 [2020-12-23 14:17:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:03,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:17:03,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:03,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538810233] [2020-12-23 14:17:03,398 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:03,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544936279] [2020-12-23 14:17:03,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:03,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:03,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407588689] [2020-12-23 14:17:03,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:03,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:03,400 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 4 states. [2020-12-23 14:17:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:03,457 INFO L93 Difference]: Finished difference Result 348 states and 433 transitions. [2020-12-23 14:17:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:03,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 14:17:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:03,460 INFO L225 Difference]: With dead ends: 348 [2020-12-23 14:17:03,460 INFO L226 Difference]: Without dead ends: 218 [2020-12-23 14:17:03,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-12-23 14:17:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2020-12-23 14:17:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-12-23 14:17:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 265 transitions. [2020-12-23 14:17:03,477 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 265 transitions. Word has length 84 [2020-12-23 14:17:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:03,477 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 265 transitions. [2020-12-23 14:17:03,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 265 transitions. [2020-12-23 14:17:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 14:17:03,478 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:03,478 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, 1, 1, 1] [2020-12-23 14:17:03,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:03,692 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 877172746, now seen corresponding path program 1 times [2020-12-23 14:17:03,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:03,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128790353] [2020-12-23 14:17:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:03,816 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:03,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621331468] [2020-12-23 14:17:03,817 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 [2020-12-23 14:17:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:04,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 2698 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:17:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:04,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128790353] [2020-12-23 14:17:04,893 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:04,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621331468] [2020-12-23 14:17:04,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:04,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:04,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496425013] [2020-12-23 14:17:04,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:04,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:04,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:04,895 INFO L87 Difference]: Start difference. First operand 214 states and 265 transitions. Second operand 4 states. [2020-12-23 14:17:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:05,068 INFO L93 Difference]: Finished difference Result 396 states and 494 transitions. [2020-12-23 14:17:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:05,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 14:17:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:05,071 INFO L225 Difference]: With dead ends: 396 [2020-12-23 14:17:05,071 INFO L226 Difference]: Without dead ends: 229 [2020-12-23 14:17:05,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-23 14:17:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2020-12-23 14:17:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-23 14:17:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2020-12-23 14:17:05,088 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 270 transitions. Word has length 84 [2020-12-23 14:17:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:05,089 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 270 transitions. [2020-12-23 14:17:05,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 270 transitions. [2020-12-23 14:17:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 14:17:05,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:05,090 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, 1, 1, 1, 1, 1] [2020-12-23 14:17:05,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 14:17:05,305 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1654312400, now seen corresponding path program 1 times [2020-12-23 14:17:05,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:05,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136158113] [2020-12-23 14:17:05,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:05,405 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:05,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831277015] [2020-12-23 14:17:05,405 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:06,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 14:17:06,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:06,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136158113] [2020-12-23 14:17:06,619 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:06,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831277015] [2020-12-23 14:17:06,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:06,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:17:06,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679316268] [2020-12-23 14:17:06,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:17:06,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:06,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:17:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:06,621 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. Second operand 5 states. [2020-12-23 14:17:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:11,872 INFO L93 Difference]: Finished difference Result 499 states and 612 transitions. [2020-12-23 14:17:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:17:11,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2020-12-23 14:17:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:11,877 INFO L225 Difference]: With dead ends: 499 [2020-12-23 14:17:11,877 INFO L226 Difference]: Without dead ends: 327 [2020-12-23 14:17:11,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:17:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-23 14:17:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 223. [2020-12-23 14:17:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-12-23 14:17:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2020-12-23 14:17:11,896 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 86 [2020-12-23 14:17:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:11,896 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2020-12-23 14:17:11,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:17:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2020-12-23 14:17:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 14:17:11,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:11,898 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, 1, 1, 1, 1, 1] [2020-12-23 14:17:12,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 14:17:12,101 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash 273960302, now seen corresponding path program 1 times [2020-12-23 14:17:12,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:12,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259943406] [2020-12-23 14:17:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:12,215 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:12,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821464813] [2020-12-23 14:17:12,216 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 90 conjunts are in the unsatisfiable core [2020-12-23 14:17:14,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:14,592 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 14:17:14,593 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:14,606 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,607 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 14:17:14,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:17:14,854 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-12-23 14:17:14,856 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:14,884 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,884 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2020-12-23 14:17:14,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:17:14,960 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-23 14:17:14,962 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:14,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:14,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2020-12-23 14:17:15,080 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:15,080 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 14:17:15,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:17:15,085 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:15,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:15,105 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:15,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-12-23 14:17:15,179 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 14:17:15,183 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:15,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:15,224 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:15,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:29 [2020-12-23 14:17:15,880 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 14:17:15,891 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:15,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:15,917 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:15,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2020-12-23 14:17:20,084 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 9 treesize of output 5 [2020-12-23 14:17:20,089 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:20,093 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:20,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:20,094 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:1 [2020-12-23 14:17:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:20,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259943406] [2020-12-23 14:17:20,175 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:20,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821464813] [2020-12-23 14:17:20,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:20,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-12-23 14:17:20,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429802591] [2020-12-23 14:17:20,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 14:17:20,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 14:17:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2020-12-23 14:17:20,177 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 16 states. [2020-12-23 14:17:33,508 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-23 14:17:33,792 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-12-23 14:17:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:35,700 INFO L93 Difference]: Finished difference Result 645 states and 785 transitions. [2020-12-23 14:17:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 14:17:35,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2020-12-23 14:17:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:35,704 INFO L225 Difference]: With dead ends: 645 [2020-12-23 14:17:35,704 INFO L226 Difference]: Without dead ends: 486 [2020-12-23 14:17:35,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=127, Invalid=521, Unknown=2, NotChecked=0, Total=650 [2020-12-23 14:17:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-12-23 14:17:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 263. [2020-12-23 14:17:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-12-23 14:17:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 320 transitions. [2020-12-23 14:17:35,731 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 320 transitions. Word has length 86 [2020-12-23 14:17:35,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:35,731 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 320 transitions. [2020-12-23 14:17:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 14:17:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 320 transitions. [2020-12-23 14:17:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 14:17:35,732 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:35,732 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, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:35,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 14:17:35,946 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2037509238, now seen corresponding path program 1 times [2020-12-23 14:17:35,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:35,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757534952] [2020-12-23 14:17:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:36,041 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:36,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855074188] [2020-12-23 14:17:36,042 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true