/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_top_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:10:54,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:10:54,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:10:54,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:10:54,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:10:54,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:10:54,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:10:54,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:10:54,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:10:54,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:10:54,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:10:54,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:10:54,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:10:54,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:10:54,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:10:54,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:10:54,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:10:54,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:10:54,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:10:54,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:10:54,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:10:54,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:10:54,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:10:54,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:10:54,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:10:54,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:10:54,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:10:54,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:10:54,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:10:54,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:10:54,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:10:54,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:10:54,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:10:54,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:10:54,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:10:54,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:10:54,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:10:54,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:10:54,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:10:54,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:10:54,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:10:54,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:10:54,183 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:10:54,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:10:54,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:10:54,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:10:54,186 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:10:54,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:10:54,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:10:54,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:10:54,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:10:54,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:10:54,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:10:54,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:10:54,188 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:10:54,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:10:54,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:10:54,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:10:54,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:10:54,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:10:54,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:10:54,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:10:54,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:10:54,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:10:54,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:10:54,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:10:54,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:10:54,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 00:10:54,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:10:54,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:10:54,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:10:54,717 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:10:54,719 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:10:54,724 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_top_harness.i [2021-01-07 00:10:54,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a9a4a5168/f3ee798957ca4f6b94719ad1f3016fab/FLAG2c2901659 [2021-01-07 00:10:55,965 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:10:55,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_top_harness.i [2021-01-07 00:10:56,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a9a4a5168/f3ee798957ca4f6b94719ad1f3016fab/FLAG2c2901659 [2021-01-07 00:10:56,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a9a4a5168/f3ee798957ca4f6b94719ad1f3016fab [2021-01-07 00:10:56,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:10:56,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:10:56,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:56,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:10:56,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:10:56,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:56" (1/1) ... [2021-01-07 00:10:56,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580d70ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:56, skipping insertion in model container [2021-01-07 00:10:56,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:56" (1/1) ... [2021-01-07 00:10:56,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:10:56,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:10:56,893 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_top_harness.i[4496,4509] [2021-01-07 00:10:56,902 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_top_harness.i[4556,4569] [2021-01-07 00:10:56,931 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:56,949 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,] [2021-01-07 00:10:57,858 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]]]] [2021-01-07 00:10:57,935 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,936 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,936 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,937 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,938 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:57,951 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,952 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,954 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:57,955 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]]] [2021-01-07 00:10:58,282 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:58,283 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:58,285 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:58,286 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:58,287 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:58,288 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:58,289 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:58,289 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:58,290 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:58,291 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]]] [2021-01-07 00:10:58,437 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,437 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:58,536 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:10:58,552 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_top_harness.i[4496,4509] [2021-01-07 00:10:58,553 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_top_harness.i[4556,4569] [2021-01-07 00:10:58,555 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:58,556 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,] [2021-01-07 00:10:58,592 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]]]] [2021-01-07 00:10:58,614 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,615 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,615 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,616 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,617 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:58,637 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,638 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,640 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,641 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]]] [2021-01-07 00:10:58,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:58,729 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:58,730 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:58,731 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:58,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:58,733 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:58,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:58,734 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:58,735 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:58,735 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]]] [2021-01-07 00:10:58,838 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,838 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:58,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:59,987 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:10:59,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59 WrapperNode [2021-01-07 00:10:59,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:59,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:10:59,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:10:59,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:10:59,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:11:00,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:11:00,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:11:00,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:11:00,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... [2021-01-07 00:11:00,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:11:00,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:11:00,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:11:00,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:11:00,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:11:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:11:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:11:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:11:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:11:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:11:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:11:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:11:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-01-07 00:11:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:11:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:11:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:11:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:11:10,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:11:10,590 INFO L299 CfgBuilder]: Removed 280 assume(true) statements. [2021-01-07 00:11:10,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:11:10 BoogieIcfgContainer [2021-01-07 00:11:10,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:11:10,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:11:10,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:11:10,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:11:10,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:10:56" (1/3) ... [2021-01-07 00:11:10,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b97acda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:11:10, skipping insertion in model container [2021-01-07 00:11:10,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:59" (2/3) ... [2021-01-07 00:11:10,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b97acda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:11:10, skipping insertion in model container [2021-01-07 00:11:10,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:11:10" (3/3) ... [2021-01-07 00:11:10,604 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_top_harness.i [2021-01-07 00:11:10,612 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:11:10,619 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2021-01-07 00:11:10,643 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-01-07 00:11:10,721 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:11:10,722 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:11:10,722 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:11:10,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:11:10,723 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:11:10,724 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:11:10,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:11:10,724 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:11:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states. [2021-01-07 00:11:10,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:11:10,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:10,772 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] [2021-01-07 00:11:10,773 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1155465246, now seen corresponding path program 1 times [2021-01-07 00:11:10,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:10,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586199781] [2021-01-07 00:11:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:11,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586199781] [2021-01-07 00:11:11,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:11,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:11:11,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135246127] [2021-01-07 00:11:11,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:11:11,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:11,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:11:11,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:11:11,797 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 2 states. [2021-01-07 00:11:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:11,885 INFO L93 Difference]: Finished difference Result 698 states and 949 transitions. [2021-01-07 00:11:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:11:11,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2021-01-07 00:11:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:11,905 INFO L225 Difference]: With dead ends: 698 [2021-01-07 00:11:11,905 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 00:11:11,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:11:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 00:11:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2021-01-07 00:11:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 432 transitions. [2021-01-07 00:11:11,992 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 432 transitions. Word has length 44 [2021-01-07 00:11:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:11,993 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 432 transitions. [2021-01-07 00:11:11,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:11:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 432 transitions. [2021-01-07 00:11:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:11:11,996 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:11,996 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] [2021-01-07 00:11:11,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:11:11,997 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:11,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:11,998 INFO L82 PathProgramCache]: Analyzing trace with hash -892659362, now seen corresponding path program 1 times [2021-01-07 00:11:11,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:11,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842509537] [2021-01-07 00:11:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:12,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842509537] [2021-01-07 00:11:12,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:12,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:12,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924984005] [2021-01-07 00:11:12,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:12,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:12,418 INFO L87 Difference]: Start difference. First operand 345 states and 432 transitions. Second operand 4 states. [2021-01-07 00:11:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:12,510 INFO L93 Difference]: Finished difference Result 610 states and 759 transitions. [2021-01-07 00:11:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:11:12,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 00:11:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:12,515 INFO L225 Difference]: With dead ends: 610 [2021-01-07 00:11:12,515 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 00:11:12,518 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 [2021-01-07 00:11:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 00:11:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2021-01-07 00:11:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 430 transitions. [2021-01-07 00:11:12,548 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 430 transitions. Word has length 44 [2021-01-07 00:11:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:12,548 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 430 transitions. [2021-01-07 00:11:12,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 430 transitions. [2021-01-07 00:11:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:11:12,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:12,552 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] [2021-01-07 00:11:12,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:11:12,552 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash -620500979, now seen corresponding path program 1 times [2021-01-07 00:11:12,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:12,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873322083] [2021-01-07 00:11:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:12,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873322083] [2021-01-07 00:11:12,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:12,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:12,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16632946] [2021-01-07 00:11:12,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:12,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:12,943 INFO L87 Difference]: Start difference. First operand 345 states and 430 transitions. Second operand 5 states. [2021-01-07 00:11:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:13,355 INFO L93 Difference]: Finished difference Result 725 states and 889 transitions. [2021-01-07 00:11:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:13,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-07 00:11:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:13,359 INFO L225 Difference]: With dead ends: 725 [2021-01-07 00:11:13,360 INFO L226 Difference]: Without dead ends: 428 [2021-01-07 00:11:13,362 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 [2021-01-07 00:11:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-01-07 00:11:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2021-01-07 00:11:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 428 transitions. [2021-01-07 00:11:13,389 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 428 transitions. Word has length 48 [2021-01-07 00:11:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:13,389 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 428 transitions. [2021-01-07 00:11:13,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 428 transitions. [2021-01-07 00:11:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 00:11:13,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:13,392 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] [2021-01-07 00:11:13,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:11:13,393 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash -582936023, now seen corresponding path program 1 times [2021-01-07 00:11:13,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:13,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542808269] [2021-01-07 00:11:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:13,603 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:13,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801941592] [2021-01-07 00:11:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:14,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:14,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 2615 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 00:11:14,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:15,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542808269] [2021-01-07 00:11:15,142 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:15,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801941592] [2021-01-07 00:11:15,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:15,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:15,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841702027] [2021-01-07 00:11:15,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:15,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:15,145 INFO L87 Difference]: Start difference. First operand 345 states and 428 transitions. Second operand 6 states. [2021-01-07 00:11:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:15,421 INFO L93 Difference]: Finished difference Result 611 states and 754 transitions. [2021-01-07 00:11:15,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:11:15,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2021-01-07 00:11:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:15,424 INFO L225 Difference]: With dead ends: 611 [2021-01-07 00:11:15,424 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 00:11:15,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 00:11:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2021-01-07 00:11:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 426 transitions. [2021-01-07 00:11:15,446 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 426 transitions. Word has length 56 [2021-01-07 00:11:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:15,446 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 426 transitions. [2021-01-07 00:11:15,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 426 transitions. [2021-01-07 00:11:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-07 00:11:15,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:15,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:15,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:15,671 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1336520550, now seen corresponding path program 1 times [2021-01-07 00:11:15,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:15,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794249574] [2021-01-07 00:11:15,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:15,826 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:15,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328513226] [2021-01-07 00:11:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:17,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 2665 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:11:17,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:17,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794249574] [2021-01-07 00:11:17,366 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:17,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328513226] [2021-01-07 00:11:17,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:17,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:17,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361341029] [2021-01-07 00:11:17,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:11:17,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:11:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:11:17,369 INFO L87 Difference]: Start difference. First operand 345 states and 426 transitions. Second operand 7 states. [2021-01-07 00:11:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:17,959 INFO L93 Difference]: Finished difference Result 627 states and 774 transitions. [2021-01-07 00:11:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:17,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2021-01-07 00:11:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:17,962 INFO L225 Difference]: With dead ends: 627 [2021-01-07 00:11:17,962 INFO L226 Difference]: Without dead ends: 345 [2021-01-07 00:11:17,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:11:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-07 00:11:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2021-01-07 00:11:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 424 transitions. [2021-01-07 00:11:17,981 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 424 transitions. Word has length 68 [2021-01-07 00:11:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:17,981 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 424 transitions. [2021-01-07 00:11:17,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:11:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 424 transitions. [2021-01-07 00:11:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-07 00:11:17,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:17,983 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] [2021-01-07 00:11:18,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:18,198 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1065001986, now seen corresponding path program 1 times [2021-01-07 00:11:18,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:18,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831435181] [2021-01-07 00:11:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:18,328 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:18,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1484415868] [2021-01-07 00:11:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:19,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:11:19,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:19,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831435181] [2021-01-07 00:11:19,943 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:19,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484415868] [2021-01-07 00:11:19,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:19,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:19,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854214779] [2021-01-07 00:11:19,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:19,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:19,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:19,946 INFO L87 Difference]: Start difference. First operand 345 states and 424 transitions. Second operand 6 states. [2021-01-07 00:11:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:20,398 INFO L93 Difference]: Finished difference Result 683 states and 829 transitions. [2021-01-07 00:11:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:11:20,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-07 00:11:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:20,402 INFO L225 Difference]: With dead ends: 683 [2021-01-07 00:11:20,402 INFO L226 Difference]: Without dead ends: 452 [2021-01-07 00:11:20,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:11:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-07 00:11:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 345. [2021-01-07 00:11:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-07 00:11:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 421 transitions. [2021-01-07 00:11:20,425 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 421 transitions. Word has length 76 [2021-01-07 00:11:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:20,426 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 421 transitions. [2021-01-07 00:11:20,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 421 transitions. [2021-01-07 00:11:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:20,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:20,427 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, 1, 1, 1, 1, 1] [2021-01-07 00:11:20,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:20,642 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1734654266, now seen corresponding path program 1 times [2021-01-07 00:11:20,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:20,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128843843] [2021-01-07 00:11:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:20,828 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:20,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735446617] [2021-01-07 00:11:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:22,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 2950 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-07 00:11:22,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:22,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128843843] [2021-01-07 00:11:22,299 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:22,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735446617] [2021-01-07 00:11:22,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:22,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:22,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184047625] [2021-01-07 00:11:22,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:22,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:22,304 INFO L87 Difference]: Start difference. First operand 345 states and 421 transitions. Second operand 6 states. [2021-01-07 00:11:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:22,836 INFO L93 Difference]: Finished difference Result 891 states and 1076 transitions. [2021-01-07 00:11:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:22,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2021-01-07 00:11:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:22,840 INFO L225 Difference]: With dead ends: 891 [2021-01-07 00:11:22,840 INFO L226 Difference]: Without dead ends: 624 [2021-01-07 00:11:22,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:11:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-01-07 00:11:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 357. [2021-01-07 00:11:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2021-01-07 00:11:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 437 transitions. [2021-01-07 00:11:22,864 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 437 transitions. Word has length 92 [2021-01-07 00:11:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:22,865 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 437 transitions. [2021-01-07 00:11:22,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 437 transitions. [2021-01-07 00:11:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:22,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:22,866 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, 1, 1, 1, 1, 1] [2021-01-07 00:11:23,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:23,081 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 621150984, now seen corresponding path program 1 times [2021-01-07 00:11:23,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:23,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049647975] [2021-01-07 00:11:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:23,315 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:23,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81563416] [2021-01-07 00:11:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:24,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 2955 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:11:24,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:24,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:24,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049647975] [2021-01-07 00:11:24,774 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:24,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81563416] [2021-01-07 00:11:24,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:24,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:24,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620802286] [2021-01-07 00:11:24,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:24,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:24,776 INFO L87 Difference]: Start difference. First operand 357 states and 437 transitions. Second operand 6 states. [2021-01-07 00:11:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:32,800 INFO L93 Difference]: Finished difference Result 895 states and 1091 transitions. [2021-01-07 00:11:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:32,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2021-01-07 00:11:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:32,805 INFO L225 Difference]: With dead ends: 895 [2021-01-07 00:11:32,805 INFO L226 Difference]: Without dead ends: 613 [2021-01-07 00:11:32,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-01-07 00:11:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 365. [2021-01-07 00:11:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2021-01-07 00:11:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 447 transitions. [2021-01-07 00:11:32,832 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 447 transitions. Word has length 92 [2021-01-07 00:11:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:32,833 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 447 transitions. [2021-01-07 00:11:32,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 447 transitions. [2021-01-07 00:11:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:32,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:32,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:33,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:33,048 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1745543610, now seen corresponding path program 1 times [2021-01-07 00:11:33,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:33,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194168979] [2021-01-07 00:11:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:33,187 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:33,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858040565] [2021-01-07 00:11:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:34,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:34,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:34,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194168979] [2021-01-07 00:11:34,509 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:34,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858040565] [2021-01-07 00:11:34,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:34,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:34,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162757113] [2021-01-07 00:11:34,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:34,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:34,511 INFO L87 Difference]: Start difference. First operand 365 states and 447 transitions. Second operand 4 states. [2021-01-07 00:11:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:34,625 INFO L93 Difference]: Finished difference Result 667 states and 814 transitions. [2021-01-07 00:11:34,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:34,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-07 00:11:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:34,629 INFO L225 Difference]: With dead ends: 667 [2021-01-07 00:11:34,629 INFO L226 Difference]: Without dead ends: 381 [2021-01-07 00:11:34,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-01-07 00:11:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 373. [2021-01-07 00:11:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2021-01-07 00:11:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 455 transitions. [2021-01-07 00:11:34,655 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 455 transitions. Word has length 92 [2021-01-07 00:11:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:34,656 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 455 transitions. [2021-01-07 00:11:34,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 455 transitions. [2021-01-07 00:11:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:34,657 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:34,657 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, 1, 1, 1, 1, 1] [2021-01-07 00:11:34,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:34,871 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:34,872 INFO L82 PathProgramCache]: Analyzing trace with hash 500035844, now seen corresponding path program 1 times [2021-01-07 00:11:34,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:34,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391735569] [2021-01-07 00:11:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:35,077 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:35,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17403779] [2021-01-07 00:11:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:36,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 2947 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 00:11:36,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:37,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391735569] [2021-01-07 00:11:37,125 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:37,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17403779] [2021-01-07 00:11:37,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:37,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:11:37,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329045619] [2021-01-07 00:11:37,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:11:37,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:11:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:37,127 INFO L87 Difference]: Start difference. First operand 373 states and 455 transitions. Second operand 9 states. [2021-01-07 00:11:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:43,554 INFO L93 Difference]: Finished difference Result 943 states and 1149 transitions. [2021-01-07 00:11:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:11:43,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2021-01-07 00:11:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:43,559 INFO L225 Difference]: With dead ends: 943 [2021-01-07 00:11:43,559 INFO L226 Difference]: Without dead ends: 645 [2021-01-07 00:11:43,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:11:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-01-07 00:11:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 403. [2021-01-07 00:11:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2021-01-07 00:11:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 493 transitions. [2021-01-07 00:11:43,587 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 493 transitions. Word has length 92 [2021-01-07 00:11:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:43,587 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 493 transitions. [2021-01-07 00:11:43,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:11:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 493 transitions. [2021-01-07 00:11:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:43,588 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:43,588 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, 1, 1, 1, 1, 1] [2021-01-07 00:11:43,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 00:11:43,804 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 140070726, now seen corresponding path program 1 times [2021-01-07 00:11:43,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:43,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373620988] [2021-01-07 00:11:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:43,935 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:43,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311743164] [2021-01-07 00:11:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:45,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:45,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:45,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373620988] [2021-01-07 00:11:45,376 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:45,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311743164] [2021-01-07 00:11:45,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:45,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:45,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523695017] [2021-01-07 00:11:45,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:45,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:45,378 INFO L87 Difference]: Start difference. First operand 403 states and 493 transitions. Second operand 4 states. [2021-01-07 00:11:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:45,481 INFO L93 Difference]: Finished difference Result 706 states and 859 transitions. [2021-01-07 00:11:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:45,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-07 00:11:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:45,484 INFO L225 Difference]: With dead ends: 706 [2021-01-07 00:11:45,484 INFO L226 Difference]: Without dead ends: 395 [2021-01-07 00:11:45,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-07 00:11:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 387. [2021-01-07 00:11:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2021-01-07 00:11:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 469 transitions. [2021-01-07 00:11:45,507 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 469 transitions. Word has length 92 [2021-01-07 00:11:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:45,508 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 469 transitions. [2021-01-07 00:11:45,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 469 transitions. [2021-01-07 00:11:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 00:11:45,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:45,509 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, 1, 1, 1, 1, 1] [2021-01-07 00:11:45,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-07 00:11:45,723 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1886821254, now seen corresponding path program 1 times [2021-01-07 00:11:45,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:45,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863000365] [2021-01-07 00:11:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:45,851 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:45,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906142056] [2021-01-07 00:11:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:47,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:47,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:47,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863000365] [2021-01-07 00:11:47,230 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:47,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906142056] [2021-01-07 00:11:47,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:47,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:47,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074734003] [2021-01-07 00:11:47,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:47,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:47,233 INFO L87 Difference]: Start difference. First operand 387 states and 469 transitions. Second operand 4 states. [2021-01-07 00:11:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:47,816 INFO L93 Difference]: Finished difference Result 772 states and 944 transitions. [2021-01-07 00:11:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:47,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-07 00:11:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:47,820 INFO L225 Difference]: With dead ends: 772 [2021-01-07 00:11:47,820 INFO L226 Difference]: Without dead ends: 432 [2021-01-07 00:11:47,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-07 00:11:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 405. [2021-01-07 00:11:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2021-01-07 00:11:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 485 transitions. [2021-01-07 00:11:47,848 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 485 transitions. Word has length 92 [2021-01-07 00:11:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:47,849 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 485 transitions. [2021-01-07 00:11:47,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 485 transitions. [2021-01-07 00:11:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-07 00:11:47,850 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:47,850 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:48,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:48,066 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 713142188, now seen corresponding path program 1 times [2021-01-07 00:11:48,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:48,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733813687] [2021-01-07 00:11:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:48,202 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:48,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226680312] [2021-01-07 00:11:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:49,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 2947 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:11:49,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:11:49,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733813687] [2021-01-07 00:11:49,672 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:49,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226680312] [2021-01-07 00:11:49,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:49,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:49,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511195775] [2021-01-07 00:11:49,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:49,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:49,674 INFO L87 Difference]: Start difference. First operand 405 states and 485 transitions. Second operand 5 states. [2021-01-07 00:11:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:55,496 INFO L93 Difference]: Finished difference Result 940 states and 1113 transitions. [2021-01-07 00:11:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:11:55,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2021-01-07 00:11:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:55,500 INFO L225 Difference]: With dead ends: 940 [2021-01-07 00:11:55,500 INFO L226 Difference]: Without dead ends: 583 [2021-01-07 00:11:55,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:11:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-01-07 00:11:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 414. [2021-01-07 00:11:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2021-01-07 00:11:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 492 transitions. [2021-01-07 00:11:55,527 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 492 transitions. Word has length 94 [2021-01-07 00:11:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:55,528 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 492 transitions. [2021-01-07 00:11:55,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 492 transitions. [2021-01-07 00:11:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-07 00:11:55,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:55,529 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:55,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:55,744 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1589161194, now seen corresponding path program 1 times [2021-01-07 00:11:55,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:55,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492263393] [2021-01-07 00:11:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:55,864 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:55,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323301535] [2021-01-07 00:11:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:58,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 82 conjunts are in the unsatisfiable core [2021-01-07 00:11:58,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:58,938 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 [2021-01-07 00:11:58,940 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:58,952 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:58,953 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:58,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 00:11:59,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:59,235 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 [2021-01-07 00:11:59,237 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,263 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2021-01-07 00:11:59,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:59,336 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 [2021-01-07 00:11:59,338 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,357 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,358 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2021-01-07 00:11:59,468 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,468 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 [2021-01-07 00:11:59,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:59,475 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,494 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,495 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-01-07 00:11:59,578 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 [2021-01-07 00:11:59,585 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,608 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,620 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. [2021-01-07 00:11:59,620 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:26 [2021-01-07 00:12:03,734 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-07 00:12:05,935 WARN L197 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2021-01-07 00:12:06,749 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2021-01-07 00:12:06,823 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 [2021-01-07 00:12:06,826 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:12:06,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:12:06,851 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. [2021-01-07 00:12:06,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2021-01-07 00:12:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:12:07,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492263393] [2021-01-07 00:12:07,124 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:07,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323301535] [2021-01-07 00:12:07,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:07,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-07 00:12:07,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361746955] [2021-01-07 00:12:07,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-07 00:12:07,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-07 00:12:07,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=169, Unknown=1, NotChecked=0, Total=210 [2021-01-07 00:12:07,126 INFO L87 Difference]: Start difference. First operand 414 states and 492 transitions. Second operand 15 states. [2021-01-07 00:12:28,830 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-01-07 00:12:31,574 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 41 [2021-01-07 00:12:31,765 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2021-01-07 00:12:39,327 WARN L197 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2021-01-07 00:12:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:46,190 INFO L93 Difference]: Finished difference Result 1041 states and 1246 transitions. [2021-01-07 00:12:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 00:12:46,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2021-01-07 00:12:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:46,195 INFO L225 Difference]: With dead ends: 1041 [2021-01-07 00:12:46,195 INFO L226 Difference]: Without dead ends: 699 [2021-01-07 00:12:46,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=118, Invalid=479, Unknown=3, NotChecked=0, Total=600 [2021-01-07 00:12:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-07 00:12:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 451. [2021-01-07 00:12:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2021-01-07 00:12:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 536 transitions. [2021-01-07 00:12:46,226 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 536 transitions. Word has length 94 [2021-01-07 00:12:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:46,226 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 536 transitions. [2021-01-07 00:12:46,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-07 00:12:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 536 transitions. [2021-01-07 00:12:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-07 00:12:46,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:12:46,228 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:12:46,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 00:12:46,442 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:12:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:12:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1320642810, now seen corresponding path program 1 times [2021-01-07 00:12:46,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:12:46,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453774082] [2021-01-07 00:12:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:12:46,546 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:12:46,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319194046] [2021-01-07 00:12:46,546 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