/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_byte_buf_reset_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:06:22,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:06:22,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:06:22,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:06:22,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:06:22,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:06:22,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:06:22,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:06:22,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:06:22,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:06:22,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:06:22,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:06:22,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:06:22,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:06:22,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:06:22,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:06:22,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:06:22,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:06:22,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:06:22,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:06:22,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:06:22,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:06:22,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:06:22,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:06:22,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:06:22,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:06:22,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:06:22,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:06:22,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:06:22,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:06:22,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:06:22,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:06:22,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:06:22,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:06:22,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:06:22,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:06:22,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:06:22,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:06:22,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:06:22,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:06:22,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:06:22,500 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:06:22,546 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:06:22,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:06:22,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:06:22,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:06:22,555 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:06:22,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:06:22,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:06:22,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:06:22,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:06:22,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:06:22,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:06:22,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:06:22,559 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:06:22,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:06:22,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:06:22,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:06:22,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:06:22,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:06:22,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:06:22,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:06:22,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:06:22,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:06:22,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:06:22,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:06:22,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:06:22,564 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:06:23,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:06:23,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:06:23,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:06:23,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:06:23,102 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:06:23,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i [2021-01-07 00:06:23,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/24188f6c4/e9d0bfc2827e4ae4af0a2b3a109c03ac/FLAG05b0f0a92 [2021-01-07 00:06:24,430 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:06:24,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reset_harness.i [2021-01-07 00:06:24,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/24188f6c4/e9d0bfc2827e4ae4af0a2b3a109c03ac/FLAG05b0f0a92 [2021-01-07 00:06:24,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/24188f6c4/e9d0bfc2827e4ae4af0a2b3a109c03ac [2021-01-07 00:06:24,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:06:24,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:06:24,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:24,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:06:24,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:06:24,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:06:24" (1/1) ... [2021-01-07 00:06:24,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37792bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:24, skipping insertion in model container [2021-01-07 00:06:24,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:06:24" (1/1) ... [2021-01-07 00:06:24,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:06:25,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:06:25,488 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_byte_buf_reset_harness.i[4492,4505] [2021-01-07 00:06:25,498 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_byte_buf_reset_harness.i[4552,4565] [2021-01-07 00:06:25,536 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:25,546 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:06:27,089 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,094 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,095 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,096 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,099 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:06:27,136 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,139 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,144 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,145 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~mem306,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem306,],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~mem317,],base],StructAccessExpression[IdentifierExpression[#t~mem317,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem318,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem318,],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~mem329,],base],StructAccessExpression[IdentifierExpression[#t~mem329,],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~mem336,],base],StructAccessExpression[IdentifierExpression[#t~mem336,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem338,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem338,],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~mem382,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem382,],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~mem384,],base],StructAccessExpression[IdentifierExpression[#t~mem384,],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~mem385,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem385,],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~mem386,],base],StructAccessExpression[IdentifierExpression[#t~mem386,],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:06:27,766 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:27,768 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:27,769 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:27,771 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:27,773 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:27,773 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:27,774 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:27,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:27,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:27,776 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~mem509,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem509,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem512,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem512,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2021-01-07 00:06:27,977 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: 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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],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[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dest,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first_run~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~substr,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem865,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem865,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem864,],IdentifierExpression[~i~12,]],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_buffer~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buffer,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buffer,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~comparison_length~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~0,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~1,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],buffer] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],capacity] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~buf~2,],allocator] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~0,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~0,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~1,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~1,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~2,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cur~2,],len] [2021-01-07 00:06:28,153 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,154 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~6,],len] left hand side expression in assignment: lhs: VariableLHS[~len,] ----Is the binary operator a bitwise operator? true 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[~cursor,],base],StructAccessExpression[IdentifierExpression[~cursor,],offset]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],len] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],ptr] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rv~7,],len] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~output,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~output,],base],StructAccessExpression[IdentifierExpression[~output,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] left hand side expression in assignment: lhs: VariableLHS[~x,] [2021-01-07 00:06:28,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:28,284 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:06:28,317 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_byte_buf_reset_harness.i[4492,4505] [2021-01-07 00:06:28,318 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_byte_buf_reset_harness.i[4552,4565] [2021-01-07 00:06:28,320 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:28,321 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:06:28,366 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,367 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,367 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,368 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,369 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:06:28,375 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,376 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,377 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,378 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~mem319,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem319,],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~mem330,],base],StructAccessExpression[IdentifierExpression[#t~mem330,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem331,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem331,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],StructAccessExpression[IdentifierExpression[#t~mem332,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem333,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem333,],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~mem346,],base],StructAccessExpression[IdentifierExpression[#t~mem346,],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~mem353,],base],StructAccessExpression[IdentifierExpression[#t~mem353,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem355,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem355,],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~mem399,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem399,],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~mem401,],base],StructAccessExpression[IdentifierExpression[#t~mem401,],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~mem402,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem402,],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~mem403,],base],StructAccessExpression[IdentifierExpression[#t~mem403,],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:06:28,442 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:28,444 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:28,444 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:28,445 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:28,447 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:28,448 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:28,448 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:28,449 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:28,449 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:28,449 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~mem526,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem526,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem529,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem529,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] [2021-01-07 00:06:28,498 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: 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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],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[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~dest,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],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[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],StructAccessExpression[IdentifierExpression[~buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~dest,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~first_run~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~substr,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~substr,],base],StructAccessExpression[IdentifierExpression[~substr,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem896,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem896,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem895,],IdentifierExpression[~i~12,]],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_capacity~0,] left hand side expression in assignment: lhs: VariableLHS[~new_buffer~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buffer,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~buffer,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~comparison_length~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#buf~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#buf~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~0,],base],StructAccessExpression[IdentifierExpression[~#cur~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~1,],base],StructAccessExpression[IdentifierExpression[~#cur~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cur~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cur~2,],base],StructAccessExpression[IdentifierExpression[~#cur~2,],offset]]] [2021-01-07 00:06:28,611 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:28,612 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: lhs: VariableLHS[~combined_mask~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~6,],base],StructAccessExpression[IdentifierExpression[~#rv~6,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~len,] ----Is the binary operator a bitwise operator? true 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[~cursor,],base],StructAccessExpression[IdentifierExpression[~cursor,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rv~7,],base],StructAccessExpression[IdentifierExpression[~#rv~7,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dest,],base],StructAccessExpression[IdentifierExpression[~dest,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: IdentifierExpression[~output,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~output,],base],StructAccessExpression[IdentifierExpression[~output,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] left hand side expression in assignment: address: IdentifierExpression[~#x,] [2021-01-07 00:06:28,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:29,730 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:06:29,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29 WrapperNode [2021-01-07 00:06:29,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:29,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:29,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:06:29,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:06:29,743 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:06:29" (1/1) ... [2021-01-07 00:06:29,933 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:06:29" (1/1) ... [2021-01-07 00:06:30,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:30,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:06:30,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:06:30,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:06:30,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (1/1) ... [2021-01-07 00:06:30,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:06:30,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:06:30,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:06:30,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:06:30,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (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:06:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:06:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:06:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:06:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:06:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:06:30,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:06:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:06:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:06:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:06:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:06:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:06:39,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:06:39,880 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-01-07 00:06:39,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:06:39 BoogieIcfgContainer [2021-01-07 00:06:39,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:06:39,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:06:39,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:06:39,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:06:39,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:06:24" (1/3) ... [2021-01-07 00:06:39,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd26dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:06:39, skipping insertion in model container [2021-01-07 00:06:39,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:29" (2/3) ... [2021-01-07 00:06:39,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd26dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:06:39, skipping insertion in model container [2021-01-07 00:06:39,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:06:39" (3/3) ... [2021-01-07 00:06:39,893 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reset_harness.i [2021-01-07 00:06:39,900 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:06:39,907 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 00:06:39,949 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 00:06:40,025 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:06:40,026 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:06:40,026 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:06:40,026 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:06:40,029 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:06:40,029 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:06:40,030 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:06:40,030 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:06:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2021-01-07 00:06:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 00:06:40,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:40,065 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] [2021-01-07 00:06:40,065 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1062443937, now seen corresponding path program 1 times [2021-01-07 00:06:40,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:40,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955905008] [2021-01-07 00:06:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:41,022 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:06:41,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955905008] [2021-01-07 00:06:41,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:41,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:06:41,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742785059] [2021-01-07 00:06:41,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:06:41,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:06:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:06:41,057 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2021-01-07 00:06:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:41,087 INFO L93 Difference]: Finished difference Result 216 states and 295 transitions. [2021-01-07 00:06:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:06:41,089 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2021-01-07 00:06:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:41,100 INFO L225 Difference]: With dead ends: 216 [2021-01-07 00:06:41,100 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 00:06:41,104 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:06:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 00:06:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-01-07 00:06:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-07 00:06:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2021-01-07 00:06:41,160 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 22 [2021-01-07 00:06:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:41,161 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2021-01-07 00:06:41,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:06:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2021-01-07 00:06:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 00:06:41,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:41,163 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] [2021-01-07 00:06:41,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:06:41,163 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1987497567, now seen corresponding path program 1 times [2021-01-07 00:06:41,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:41,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508076236] [2021-01-07 00:06:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:41,621 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:06:41,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508076236] [2021-01-07 00:06:41,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:41,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:41,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695812364] [2021-01-07 00:06:41,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:41,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:41,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:41,640 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 4 states. [2021-01-07 00:06:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:41,796 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2021-01-07 00:06:41,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:06:41,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-01-07 00:06:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:41,802 INFO L225 Difference]: With dead ends: 180 [2021-01-07 00:06:41,803 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 00:06:41,804 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:06:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 00:06:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-01-07 00:06:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-07 00:06:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2021-01-07 00:06:41,823 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 22 [2021-01-07 00:06:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:41,823 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2021-01-07 00:06:41,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2021-01-07 00:06:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:06:41,828 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:41,828 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] [2021-01-07 00:06:41,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:06:41,828 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1026351090, now seen corresponding path program 1 times [2021-01-07 00:06:41,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:41,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873507897] [2021-01-07 00:06:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:42,261 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:06:42,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873507897] [2021-01-07 00:06:42,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:42,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:42,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438079275] [2021-01-07 00:06:42,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:42,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:42,276 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 4 states. [2021-01-07 00:06:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:42,453 INFO L93 Difference]: Finished difference Result 211 states and 264 transitions. [2021-01-07 00:06:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:42,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2021-01-07 00:06:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:42,462 INFO L225 Difference]: With dead ends: 211 [2021-01-07 00:06:42,462 INFO L226 Difference]: Without dead ends: 133 [2021-01-07 00:06:42,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-01-07 00:06:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2021-01-07 00:06:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-07 00:06:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2021-01-07 00:06:42,496 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 28 [2021-01-07 00:06:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:42,497 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2021-01-07 00:06:42,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2021-01-07 00:06:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:06:42,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:42,504 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] [2021-01-07 00:06:42,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:06:42,504 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -439545076, now seen corresponding path program 1 times [2021-01-07 00:06:42,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:42,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906479198] [2021-01-07 00:06:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:43,432 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:06:43,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906479198] [2021-01-07 00:06:43,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:43,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:43,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871002641] [2021-01-07 00:06:43,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:43,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:43,441 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 5 states. [2021-01-07 00:06:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:45,865 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2021-01-07 00:06:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:45,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-07 00:06:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:45,867 INFO L225 Difference]: With dead ends: 109 [2021-01-07 00:06:45,867 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 00:06:45,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:06:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 00:06:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-01-07 00:06:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 00:06:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2021-01-07 00:06:45,875 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 28 [2021-01-07 00:06:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:45,876 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2021-01-07 00:06:45,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2021-01-07 00:06:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-07 00:06:45,877 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:45,877 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] [2021-01-07 00:06:45,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:06:45,878 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:45,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1495890418, now seen corresponding path program 1 times [2021-01-07 00:06:45,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:45,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504861294] [2021-01-07 00:06:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:46,960 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2021-01-07 00:06:47,064 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:06:47,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504861294] [2021-01-07 00:06:47,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:47,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:06:47,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828718208] [2021-01-07 00:06:47,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:06:47,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:06:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:06:47,067 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 6 states. [2021-01-07 00:06:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:49,663 INFO L93 Difference]: Finished difference Result 137 states and 161 transitions. [2021-01-07 00:06:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:49,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2021-01-07 00:06:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:49,666 INFO L225 Difference]: With dead ends: 137 [2021-01-07 00:06:49,666 INFO L226 Difference]: Without dead ends: 135 [2021-01-07 00:06:49,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-07 00:06:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2021-01-07 00:06:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-01-07 00:06:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-01-07 00:06:49,683 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 30 [2021-01-07 00:06:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:49,688 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-01-07 00:06:49,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:06:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-01-07 00:06:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 00:06:49,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:49,692 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] [2021-01-07 00:06:49,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 00:06:49,692 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1263485360, now seen corresponding path program 1 times [2021-01-07 00:06:49,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:49,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845553582] [2021-01-07 00:06:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:50,809 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:06:50,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845553582] [2021-01-07 00:06:50,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:50,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:06:50,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092665109] [2021-01-07 00:06:50,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:06:50,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:06:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:06:50,812 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 6 states. [2021-01-07 00:06:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:55,718 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2021-01-07 00:06:55,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:55,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2021-01-07 00:06:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:55,721 INFO L225 Difference]: With dead ends: 135 [2021-01-07 00:06:55,721 INFO L226 Difference]: Without dead ends: 133 [2021-01-07 00:06:55,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-01-07 00:06:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2021-01-07 00:06:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-07 00:06:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2021-01-07 00:06:55,729 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 32 [2021-01-07 00:06:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:55,729 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2021-01-07 00:06:55,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:06:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2021-01-07 00:06:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 00:06:55,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:55,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:06:55,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 00:06:55,732 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1266180622, now seen corresponding path program 1 times [2021-01-07 00:06:55,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:55,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682264662] [2021-01-07 00:06:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:59,684 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:06:59,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682264662] [2021-01-07 00:06:59,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:59,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:06:59,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407084010] [2021-01-07 00:06:59,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:06:59,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:06:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:06:59,687 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 6 states. [2021-01-07 00:07:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:02,289 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2021-01-07 00:07:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:07:02,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2021-01-07 00:07:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:02,296 INFO L225 Difference]: With dead ends: 133 [2021-01-07 00:07:02,296 INFO L226 Difference]: Without dead ends: 131 [2021-01-07 00:07:02,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-01-07 00:07:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2021-01-07 00:07:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-07 00:07:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2021-01-07 00:07:02,303 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 34 [2021-01-07 00:07:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:02,303 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2021-01-07 00:07:02,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:07:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2021-01-07 00:07:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 00:07:02,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:02,305 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] [2021-01-07 00:07:02,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 00:07:02,305 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash -423727705, now seen corresponding path program 1 times [2021-01-07 00:07:02,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:02,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321324907] [2021-01-07 00:07:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:02,637 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:07:02,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321324907] [2021-01-07 00:07:02,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:02,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:07:02,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698008775] [2021-01-07 00:07:02,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:07:02,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:07:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:02,642 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 7 states. [2021-01-07 00:07:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:02,880 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2021-01-07 00:07:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:07:02,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2021-01-07 00:07:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:02,882 INFO L225 Difference]: With dead ends: 175 [2021-01-07 00:07:02,883 INFO L226 Difference]: Without dead ends: 116 [2021-01-07 00:07:02,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:07:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-07 00:07:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-01-07 00:07:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2021-01-07 00:07:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2021-01-07 00:07:02,893 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 36 [2021-01-07 00:07:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:02,895 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2021-01-07 00:07:02,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:07:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2021-01-07 00:07:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 00:07:02,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:02,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:07:02,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 00:07:02,900 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1985324549, now seen corresponding path program 1 times [2021-01-07 00:07:02,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:02,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467974840] [2021-01-07 00:07:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:04,105 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:07:04,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467974840] [2021-01-07 00:07:04,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:04,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:07:04,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698057409] [2021-01-07 00:07:04,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:07:04,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:07:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:07:04,108 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand 4 states. [2021-01-07 00:07:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:04,169 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-01-07 00:07:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:07:04,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2021-01-07 00:07:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:04,172 INFO L225 Difference]: With dead ends: 125 [2021-01-07 00:07:04,172 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 00:07:04,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 00:07:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-01-07 00:07:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 00:07:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2021-01-07 00:07:04,178 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 41 [2021-01-07 00:07:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:04,179 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2021-01-07 00:07:04,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:07:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2021-01-07 00:07:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:07:04,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:04,180 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] [2021-01-07 00:07:04,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 00:07:04,181 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1569295218, now seen corresponding path program 1 times [2021-01-07 00:07:04,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:04,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938762099] [2021-01-07 00:07:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:04,590 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:07:04,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938762099] [2021-01-07 00:07:04,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:04,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:07:04,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513871631] [2021-01-07 00:07:04,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:07:04,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:07:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:04,594 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 8 states. [2021-01-07 00:07:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:04,890 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2021-01-07 00:07:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:07:04,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2021-01-07 00:07:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:04,892 INFO L225 Difference]: With dead ends: 137 [2021-01-07 00:07:04,893 INFO L226 Difference]: Without dead ends: 107 [2021-01-07 00:07:04,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-07 00:07:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-01-07 00:07:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-01-07 00:07:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2021-01-07 00:07:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-01-07 00:07:04,903 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 42 [2021-01-07 00:07:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:04,906 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-01-07 00:07:04,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:07:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-01-07 00:07:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:07:04,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:04,909 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:07:04,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 00:07:04,910 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:04,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2099325991, now seen corresponding path program 1 times [2021-01-07 00:07:04,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:04,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371116074] [2021-01-07 00:07:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:05,427 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:07:05,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371116074] [2021-01-07 00:07:05,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:05,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:07:05,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882733908] [2021-01-07 00:07:05,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:07:05,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:05,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:07:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:07:05,431 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand 6 states. [2021-01-07 00:07:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:05,748 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2021-01-07 00:07:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:07:05,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2021-01-07 00:07:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:05,752 INFO L225 Difference]: With dead ends: 159 [2021-01-07 00:07:05,752 INFO L226 Difference]: Without dead ends: 157 [2021-01-07 00:07:05,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-07 00:07:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 111. [2021-01-07 00:07:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-01-07 00:07:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-01-07 00:07:05,759 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 48 [2021-01-07 00:07:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:05,761 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-01-07 00:07:05,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:07:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-01-07 00:07:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:07:05,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:05,763 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] [2021-01-07 00:07:05,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 00:07:05,763 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:05,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2070696161, now seen corresponding path program 1 times [2021-01-07 00:07:05,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:05,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467216013] [2021-01-07 00:07:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:06,442 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:07:06,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467216013] [2021-01-07 00:07:06,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:06,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:07:06,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284664980] [2021-01-07 00:07:06,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:07:06,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:07:06,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:06,445 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand 5 states. [2021-01-07 00:07:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:09,103 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2021-01-07 00:07:09,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:07:09,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-01-07 00:07:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:09,105 INFO L225 Difference]: With dead ends: 150 [2021-01-07 00:07:09,105 INFO L226 Difference]: Without dead ends: 118 [2021-01-07 00:07:09,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-07 00:07:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2021-01-07 00:07:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-01-07 00:07:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2021-01-07 00:07:09,112 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 52 [2021-01-07 00:07:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:09,113 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2021-01-07 00:07:09,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:07:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2021-01-07 00:07:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:07:09,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:09,114 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] [2021-01-07 00:07:09,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 00:07:09,114 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1390637791, now seen corresponding path program 1 times [2021-01-07 00:07:09,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:09,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618062731] [2021-01-07 00:07:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:13,646 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:07:13,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618062731] [2021-01-07 00:07:13,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:13,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:07:13,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623667351] [2021-01-07 00:07:13,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:07:13,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:13,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:07:13,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:07:13,654 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 9 states. [2021-01-07 00:07:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:18,534 INFO L93 Difference]: Finished difference Result 222 states and 254 transitions. [2021-01-07 00:07:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:07:18,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-07 00:07:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:18,537 INFO L225 Difference]: With dead ends: 222 [2021-01-07 00:07:18,537 INFO L226 Difference]: Without dead ends: 170 [2021-01-07 00:07:18,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-07 00:07:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-01-07 00:07:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 113. [2021-01-07 00:07:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-01-07 00:07:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-01-07 00:07:18,546 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 52 [2021-01-07 00:07:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:18,547 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-01-07 00:07:18,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:07:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-01-07 00:07:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:07:18,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:18,548 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] [2021-01-07 00:07:18,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 00:07:18,548 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1089047466, now seen corresponding path program 1 times [2021-01-07 00:07:18,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:18,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032049624] [2021-01-07 00:07:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:22,023 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:07:22,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032049624] [2021-01-07 00:07:22,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:22,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:07:22,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264525815] [2021-01-07 00:07:22,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:07:22,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:07:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:22,027 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 10 states. [2021-01-07 00:07:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:27,724 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2021-01-07 00:07:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:07:27,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2021-01-07 00:07:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:27,727 INFO L225 Difference]: With dead ends: 217 [2021-01-07 00:07:27,727 INFO L226 Difference]: Without dead ends: 131 [2021-01-07 00:07:27,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:07:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-01-07 00:07:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2021-01-07 00:07:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-01-07 00:07:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2021-01-07 00:07:27,736 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 58 [2021-01-07 00:07:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:27,736 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2021-01-07 00:07:27,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:07:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2021-01-07 00:07:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 00:07:27,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:27,737 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] [2021-01-07 00:07:27,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 00:07:27,737 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1725677344, now seen corresponding path program 1 times [2021-01-07 00:07:27,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:27,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120139299] [2021-01-07 00:07:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:28,597 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:07:28,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120139299] [2021-01-07 00:07:28,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:28,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 00:07:28,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564319266] [2021-01-07 00:07:28,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 00:07:28,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 00:07:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:07:28,600 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 11 states. [2021-01-07 00:07:39,946 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2021-01-07 00:07:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:41,780 INFO L93 Difference]: Finished difference Result 301 states and 364 transitions. [2021-01-07 00:07:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 00:07:41,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2021-01-07 00:07:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:41,784 INFO L225 Difference]: With dead ends: 301 [2021-01-07 00:07:41,784 INFO L226 Difference]: Without dead ends: 207 [2021-01-07 00:07:41,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-01-07 00:07:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-01-07 00:07:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-01-07 00:07:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-01-07 00:07:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2021-01-07 00:07:41,794 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 62 [2021-01-07 00:07:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:41,795 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2021-01-07 00:07:41,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 00:07:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2021-01-07 00:07:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-07 00:07:41,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:41,796 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] [2021-01-07 00:07:41,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 00:07:41,796 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1372588962, now seen corresponding path program 1 times [2021-01-07 00:07:41,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:41,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323285564] [2021-01-07 00:07:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:42,484 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:07:42,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323285564] [2021-01-07 00:07:42,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:42,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:07:42,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543749103] [2021-01-07 00:07:42,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:07:42,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:42,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:07:42,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:42,487 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 7 states. [2021-01-07 00:07:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:43,059 INFO L93 Difference]: Finished difference Result 270 states and 306 transitions. [2021-01-07 00:07:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:07:43,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2021-01-07 00:07:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:43,062 INFO L225 Difference]: With dead ends: 270 [2021-01-07 00:07:43,062 INFO L226 Difference]: Without dead ends: 165 [2021-01-07 00:07:43,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-01-07 00:07:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 133. [2021-01-07 00:07:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-01-07 00:07:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2021-01-07 00:07:43,073 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 62 [2021-01-07 00:07:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:43,073 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2021-01-07 00:07:43,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:07:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2021-01-07 00:07:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:07:43,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:43,074 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] [2021-01-07 00:07:43,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 00:07:43,075 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:43,075 INFO L82 PathProgramCache]: Analyzing trace with hash 428165571, now seen corresponding path program 1 times [2021-01-07 00:07:43,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:43,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182523716] [2021-01-07 00:07:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:43,562 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:07:43,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182523716] [2021-01-07 00:07:43,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:43,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:07:43,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316593449] [2021-01-07 00:07:43,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:07:43,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:43,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:07:43,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:43,566 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 5 states. [2021-01-07 00:07:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:46,489 INFO L93 Difference]: Finished difference Result 339 states and 385 transitions. [2021-01-07 00:07:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:07:46,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2021-01-07 00:07:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:46,492 INFO L225 Difference]: With dead ends: 339 [2021-01-07 00:07:46,492 INFO L226 Difference]: Without dead ends: 231 [2021-01-07 00:07:46,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-01-07 00:07:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 144. [2021-01-07 00:07:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-01-07 00:07:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2021-01-07 00:07:46,502 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 64 [2021-01-07 00:07:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:46,503 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2021-01-07 00:07:46,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:07:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2021-01-07 00:07:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:07:46,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:46,504 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] [2021-01-07 00:07:46,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 00:07:46,504 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1938529023, now seen corresponding path program 1 times [2021-01-07 00:07:46,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:46,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258049466] [2021-01-07 00:07:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:46,739 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:07:46,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258049466] [2021-01-07 00:07:46,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:46,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:07:46,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031668926] [2021-01-07 00:07:46,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:07:46,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:07:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:07:46,744 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand 4 states. [2021-01-07 00:07:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:46,939 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2021-01-07 00:07:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:07:46,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-07 00:07:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:46,942 INFO L225 Difference]: With dead ends: 250 [2021-01-07 00:07:46,942 INFO L226 Difference]: Without dead ends: 121 [2021-01-07 00:07:46,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-01-07 00:07:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2021-01-07 00:07:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-01-07 00:07:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-01-07 00:07:46,954 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 64 [2021-01-07 00:07:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:46,954 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-01-07 00:07:46,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:07:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-01-07 00:07:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:07:46,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:46,955 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] [2021-01-07 00:07:46,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 00:07:46,956 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1615939257, now seen corresponding path program 1 times [2021-01-07 00:07:46,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:46,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836646502] [2021-01-07 00:07:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:51,753 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:07:51,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836646502] [2021-01-07 00:07:51,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:51,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 00:07:51,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133540985] [2021-01-07 00:07:51,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 00:07:51,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 00:07:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:07:51,756 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 12 states. [2021-01-07 00:08:03,340 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-01-07 00:08:03,510 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-01-07 00:08:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:04,407 INFO L93 Difference]: Finished difference Result 276 states and 296 transitions. [2021-01-07 00:08:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 00:08:04,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2021-01-07 00:08:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:04,412 INFO L225 Difference]: With dead ends: 276 [2021-01-07 00:08:04,412 INFO L226 Difference]: Without dead ends: 201 [2021-01-07 00:08:04,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-01-07 00:08:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-01-07 00:08:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 114. [2021-01-07 00:08:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-07 00:08:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2021-01-07 00:08:04,423 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 64 [2021-01-07 00:08:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:04,424 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2021-01-07 00:08:04,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 00:08:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2021-01-07 00:08:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-07 00:08:04,425 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:04,425 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] [2021-01-07 00:08:04,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 00:08:04,425 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2014332392, now seen corresponding path program 1 times [2021-01-07 00:08:04,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:04,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501425339] [2021-01-07 00:08:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:11,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501425339] [2021-01-07 00:08:11,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:11,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:08:11,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527588167] [2021-01-07 00:08:11,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:08:11,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:11,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:08:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:08:11,466 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 9 states. [2021-01-07 00:08:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:16,823 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2021-01-07 00:08:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:08:16,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2021-01-07 00:08:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:16,827 INFO L225 Difference]: With dead ends: 228 [2021-01-07 00:08:16,828 INFO L226 Difference]: Without dead ends: 167 [2021-01-07 00:08:16,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-01-07 00:08:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-07 00:08:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2021-01-07 00:08:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2021-01-07 00:08:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-01-07 00:08:16,837 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 70 [2021-01-07 00:08:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:16,838 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-01-07 00:08:16,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:08:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-01-07 00:08:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-07 00:08:16,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:16,839 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] [2021-01-07 00:08:16,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 00:08:16,839 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1933601813, now seen corresponding path program 1 times [2021-01-07 00:08:16,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:16,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473217051] [2021-01-07 00:08:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:17,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473217051] [2021-01-07 00:08:17,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:17,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 00:08:17,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578848005] [2021-01-07 00:08:17,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 00:08:17,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 00:08:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:08:17,248 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 3 states. [2021-01-07 00:08:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:17,292 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2021-01-07 00:08:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 00:08:17,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-07 00:08:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:17,296 INFO L225 Difference]: With dead ends: 177 [2021-01-07 00:08:17,296 INFO L226 Difference]: Without dead ends: 116 [2021-01-07 00:08:17,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 00:08:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-07 00:08:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-01-07 00:08:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-07 00:08:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-01-07 00:08:17,305 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 71 [2021-01-07 00:08:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:17,306 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-01-07 00:08:17,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 00:08:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-01-07 00:08:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-07 00:08:17,307 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:17,307 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] [2021-01-07 00:08:17,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 00:08:17,307 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:17,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 459517097, now seen corresponding path program 1 times [2021-01-07 00:08:17,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:17,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881497897] [2021-01-07 00:08:17,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:24,303 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2021-01-07 00:08:25,238 WARN L197 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2021-01-07 00:08:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:25,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881497897] [2021-01-07 00:08:25,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792760669] [2021-01-07 00:08:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:08:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:26,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 90 conjunts are in the unsatisfiable core [2021-01-07 00:08:26,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:08:27,054 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:08:27,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:27,087 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 00:08:27,202 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:27,203 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:08:27,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:27,222 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:27,257 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,258 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-01-07 00:08:27,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-01-07 00:08:27,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,449 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:27,459 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 00:08:27,462 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:27,493 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:08:27,493 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:12 [2021-01-07 00:08:28,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 00:08:28,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-01-07 00:08:28,518 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:28,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:28,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:08:28,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:20 [2021-01-07 00:08:28,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:28,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:28,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:28,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:08:29,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:08:29,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:08:29,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:29,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 00:08:29,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:29,673 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 30 [2021-01-07 00:08:29,676 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:29,714 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 32 treesize of output 31 [2021-01-07 00:08:29,717 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:29,749 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 30 treesize of output 29 [2021-01-07 00:08:29,753 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:29,781 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 33 treesize of output 32 [2021-01-07 00:08:29,785 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:30,621 WARN L197 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-01-07 00:08:30,623 INFO L625 ElimStorePlain]: treesize reduction 24, result has 88.6 percent of original size [2021-01-07 00:08:30,693 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2021-01-07 00:08:30,693 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:327 [2021-01-07 00:08:41,537 WARN L197 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2021-01-07 00:08:41,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:41,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:41,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2021-01-07 00:08:41,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:42,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:08:42,021 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 55 [2021-01-07 00:08:42,026 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:08:42,257 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 00:08:42,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:08:42,283 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-01-07 00:08:42,283 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:186, output treesize:178 [2021-01-07 00:08:42,770 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-01-07 00:08:42,788 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2021-01-07 00:08:42,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:08:42,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:42,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 00:08:42,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 00:08:42,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:08:42,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 00:08:42,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 00:08:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:42,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 00:08:42,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-01-07 00:08:42,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417845663] [2021-01-07 00:08:42,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 00:08:42,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 00:08:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=540, Unknown=1, NotChecked=0, Total=600 [2021-01-07 00:08:42,925 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 25 states. [2021-01-07 00:09:09,948 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2021-01-07 00:09:10,506 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2021-01-07 00:09:11,070 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2021-01-07 00:09:12,055 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2021-01-07 00:09:12,657 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2021-01-07 00:09:13,317 WARN L197 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2021-01-07 00:09:16,090 WARN L197 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 83 [2021-01-07 00:09:35,220 WARN L197 SmtUtils]: Spent 16.93 s on a formula simplification. DAG size of input: 174 DAG size of output: 112 [2021-01-07 00:09:50,990 WARN L197 SmtUtils]: Spent 13.16 s on a formula simplification. DAG size of input: 175 DAG size of output: 112