/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_reserve_relative_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:06:21,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:06:21,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:06:22,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:06:22,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:06:22,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:06:22,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:06:22,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:06:22,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:06:22,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:06:22,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:06:22,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:06:22,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:06:22,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:06:22,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:06:22,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:06:22,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:06:22,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:06:22,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:06:22,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:06:22,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:06:22,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:06:22,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:06:22,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:06:22,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:06:22,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:06:22,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:06:22,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:06:22,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:06:22,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:06:22,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:06:22,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:06:22,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:06:22,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:06:22,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:06:22,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:06:22,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:06:22,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:06:22,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:06:22,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:06:22,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:06:22,177 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,235 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:06:22,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:06:22,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:06:22,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:06:22,240 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:06:22,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:06:22,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:06:22,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:06:22,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:06:22,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:06:22,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:06:22,244 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:06:22,244 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:06:22,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:06:22,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:06:22,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:06:22,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:06:22,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:06:22,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:06:22,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:06:22,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:06:22,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:06:22,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:06:22,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:06:22,247 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:06:22,247 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:22,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:06:22,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:06:22,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:06:22,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:06:22,727 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:06:22,728 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_reserve_relative_harness.i [2021-01-07 00:06:22,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32eff9197/93252e9e5767408bb1cdfd67e3bd06ec/FLAG8bcb0fb86 [2021-01-07 00:06:24,021 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:06:24,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_relative_harness.i [2021-01-07 00:06:24,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32eff9197/93252e9e5767408bb1cdfd67e3bd06ec/FLAG8bcb0fb86 [2021-01-07 00:06:24,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/32eff9197/93252e9e5767408bb1cdfd67e3bd06ec [2021-01-07 00:06:24,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:06:24,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:06:24,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:24,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:06:24,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:06:24,408 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,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47179821 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,411 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,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:06:24,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:06:24,948 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_reserve_relative_harness.i[4503,4516] [2021-01-07 00:06:24,956 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_reserve_relative_harness.i[4563,4576] [2021-01-07 00:06:24,985 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:24,992 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:26,008 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,009 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,010 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,011 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,012 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:26,030 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,031 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,033 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,034 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:26,533 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:26,535 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:26,536 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:26,538 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:26,540 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:26,541 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:26,542 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:26,543 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:26,543 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:26,544 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[#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:26,794 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: lhs: VariableLHS[~tl_last_error~0,GLOBAL] [2021-01-07 00:06:26,807 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,808 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dst,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~dst,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~index~0,],IntegerLiteral[4294967296]]]]] 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~mem806,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem806,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem805,],IdentifierExpression[~i~9,]],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:26,935 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:26,936 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:27,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:27,152 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:06:27,185 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_reserve_relative_harness.i[4503,4516] [2021-01-07 00:06:27,185 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_reserve_relative_harness.i[4563,4576] [2021-01-07 00:06:27,194 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:06:27,198 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,271 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,273 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,273 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,274 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,275 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,293 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,298 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,300 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,301 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:27,370 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:06:27,371 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:06:27,372 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:06:27,374 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:06:27,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:06:27,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:06:27,380 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:06:27,380 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:06:27,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:06:27,381 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[#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:27,423 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: lhs: VariableLHS[~tl_last_error~0,GLOBAL] [2021-01-07 00:06:27,438 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,438 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dst,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~dst,],offset],BinaryExpression[ARITHMOD,IdentifierExpression[~index~0,],IntegerLiteral[4294967296]]]]] 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~mem837,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem837,],offset],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,IdentifierExpression[#t~mem836,],IdentifierExpression[~i~9,]],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:27,520 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:06:27,521 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:27,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:06:28,784 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:06:28,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:28 WrapperNode [2021-01-07 00:06:28,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:06:28,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:28,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:06:28,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:06:28,796 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:28" (1/1) ... [2021-01-07 00:06:28,910 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:28" (1/1) ... [2021-01-07 00:06:29,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:06:29,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:06:29,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:06:29,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:06:29,080 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:28" (1/1) ... [2021-01-07 00:06:29,080 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:28" (1/1) ... [2021-01-07 00:06:29,110 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:28" (1/1) ... [2021-01-07 00:06:29,111 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:28" (1/1) ... [2021-01-07 00:06:29,210 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:28" (1/1) ... [2021-01-07 00:06:29,221 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:28" (1/1) ... [2021-01-07 00:06:29,234 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:28" (1/1) ... [2021-01-07 00:06:29,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:06:29,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:06:29,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:06:29,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:06:29,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:28" (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:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:06:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:06:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:06:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:06:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:06:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:06:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-01-07 00:06:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:06:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:06:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:06:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:06:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:06:39,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:06:39,497 INFO L299 CfgBuilder]: Removed 118 assume(true) statements. [2021-01-07 00:06:39,499 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,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:06:39,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:06:39,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:06:39,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:06:39,506 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,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2378984d 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,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:06:28" (2/3) ... [2021-01-07 00:06:39,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2378984d 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,508 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,510 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_relative_harness.i [2021-01-07 00:06:39,517 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:06:39,524 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2021-01-07 00:06:39,555 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-07 00:06:39,586 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:06:39,587 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:06:39,587 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:06:39,587 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:06:39,587 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:06:39,588 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:06:39,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:06:39,588 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:06:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2021-01-07 00:06:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 00:06:39,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:39,620 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:39,620 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash -473287577, now seen corresponding path program 1 times [2021-01-07 00:06:39,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:39,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897261749] [2021-01-07 00:06:39,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:40,576 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:40,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897261749] [2021-01-07 00:06:40,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:40,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:06:40,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252146156] [2021-01-07 00:06:40,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:06:40,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:06:40,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:06:40,618 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 2 states. [2021-01-07 00:06:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:40,717 INFO L93 Difference]: Finished difference Result 457 states and 647 transitions. [2021-01-07 00:06:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:06:40,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2021-01-07 00:06:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:40,747 INFO L225 Difference]: With dead ends: 457 [2021-01-07 00:06:40,747 INFO L226 Difference]: Without dead ends: 227 [2021-01-07 00:06:40,757 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:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-07 00:06:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-01-07 00:06:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2021-01-07 00:06:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 300 transitions. [2021-01-07 00:06:40,846 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 300 transitions. Word has length 22 [2021-01-07 00:06:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:40,846 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 300 transitions. [2021-01-07 00:06:40,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:06:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 300 transitions. [2021-01-07 00:06:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 00:06:40,848 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:40,849 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,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:06:40,849 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2061635479, now seen corresponding path program 1 times [2021-01-07 00:06:40,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:40,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470296223] [2021-01-07 00:06:40,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:41,218 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,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470296223] [2021-01-07 00:06:41,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:41,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:41,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114085915] [2021-01-07 00:06:41,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:41,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:41,225 INFO L87 Difference]: Start difference. First operand 227 states and 300 transitions. Second operand 4 states. [2021-01-07 00:06:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:41,433 INFO L93 Difference]: Finished difference Result 431 states and 569 transitions. [2021-01-07 00:06:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:06:41,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2021-01-07 00:06:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:41,439 INFO L225 Difference]: With dead ends: 431 [2021-01-07 00:06:41,439 INFO L226 Difference]: Without dead ends: 227 [2021-01-07 00:06:41,446 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:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-07 00:06:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-01-07 00:06:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2021-01-07 00:06:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 298 transitions. [2021-01-07 00:06:41,478 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 298 transitions. Word has length 22 [2021-01-07 00:06:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:41,478 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 298 transitions. [2021-01-07 00:06:41,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 298 transitions. [2021-01-07 00:06:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:06:41,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:41,480 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,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:06:41,481 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash 926477308, now seen corresponding path program 1 times [2021-01-07 00:06:41,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:41,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343028571] [2021-01-07 00:06:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:41,891 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,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343028571] [2021-01-07 00:06:41,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:41,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:41,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272397816] [2021-01-07 00:06:41,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:41,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:41,894 INFO L87 Difference]: Start difference. First operand 227 states and 298 transitions. Second operand 4 states. [2021-01-07 00:06:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:42,241 INFO L93 Difference]: Finished difference Result 616 states and 827 transitions. [2021-01-07 00:06:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:42,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2021-01-07 00:06:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:42,245 INFO L225 Difference]: With dead ends: 616 [2021-01-07 00:06:42,246 INFO L226 Difference]: Without dead ends: 403 [2021-01-07 00:06:42,247 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,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-01-07 00:06:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 243. [2021-01-07 00:06:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-01-07 00:06:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 314 transitions. [2021-01-07 00:06:42,276 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 314 transitions. Word has length 28 [2021-01-07 00:06:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:42,276 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 314 transitions. [2021-01-07 00:06:42,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 314 transitions. [2021-01-07 00:06:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:06:42,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:42,280 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,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:06:42,281 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash -94591046, now seen corresponding path program 1 times [2021-01-07 00:06:42,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:42,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761879828] [2021-01-07 00:06:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:42,566 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,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761879828] [2021-01-07 00:06:42,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:42,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:06:42,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660874547] [2021-01-07 00:06:42,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:06:42,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:06:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:06:42,569 INFO L87 Difference]: Start difference. First operand 243 states and 314 transitions. Second operand 4 states. [2021-01-07 00:06:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:42,872 INFO L93 Difference]: Finished difference Result 542 states and 709 transitions. [2021-01-07 00:06:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:06:42,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2021-01-07 00:06:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:42,875 INFO L225 Difference]: With dead ends: 542 [2021-01-07 00:06:42,875 INFO L226 Difference]: Without dead ends: 323 [2021-01-07 00:06:42,876 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,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-07 00:06:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 259. [2021-01-07 00:06:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-01-07 00:06:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 330 transitions. [2021-01-07 00:06:42,884 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 330 transitions. Word has length 28 [2021-01-07 00:06:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:42,885 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 330 transitions. [2021-01-07 00:06:42,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:06:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 330 transitions. [2021-01-07 00:06:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 00:06:42,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:42,886 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,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 00:06:42,887 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:42,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1374345282, now seen corresponding path program 1 times [2021-01-07 00:06:42,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:42,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54533968] [2021-01-07 00:06:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:43,551 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,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54533968] [2021-01-07 00:06:43,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:43,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:43,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830969099] [2021-01-07 00:06:43,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:43,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:43,554 INFO L87 Difference]: Start difference. First operand 259 states and 330 transitions. Second operand 5 states. [2021-01-07 00:06:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:43,744 INFO L93 Difference]: Finished difference Result 530 states and 672 transitions. [2021-01-07 00:06:43,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 00:06:43,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-07 00:06:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:43,748 INFO L225 Difference]: With dead ends: 530 [2021-01-07 00:06:43,748 INFO L226 Difference]: Without dead ends: 497 [2021-01-07 00:06:43,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-01-07 00:06:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 261. [2021-01-07 00:06:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2021-01-07 00:06:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 332 transitions. [2021-01-07 00:06:43,765 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 332 transitions. Word has length 28 [2021-01-07 00:06:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:43,767 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 332 transitions. [2021-01-07 00:06:43,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 332 transitions. [2021-01-07 00:06:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 00:06:43,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:43,770 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] [2021-01-07 00:06:43,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 00:06:43,770 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:43,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1363870332, now seen corresponding path program 1 times [2021-01-07 00:06:43,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:43,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542144202] [2021-01-07 00:06:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:44,321 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:44,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542144202] [2021-01-07 00:06:44,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:44,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:06:44,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321727216] [2021-01-07 00:06:44,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:06:44,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:06:44,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:06:44,324 INFO L87 Difference]: Start difference. First operand 261 states and 332 transitions. Second operand 6 states. [2021-01-07 00:06:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:45,016 INFO L93 Difference]: Finished difference Result 412 states and 506 transitions. [2021-01-07 00:06:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 00:06:45,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2021-01-07 00:06:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:45,021 INFO L225 Difference]: With dead ends: 412 [2021-01-07 00:06:45,021 INFO L226 Difference]: Without dead ends: 395 [2021-01-07 00:06:45,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:06:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-07 00:06:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 275. [2021-01-07 00:06:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2021-01-07 00:06:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 345 transitions. [2021-01-07 00:06:45,040 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 345 transitions. Word has length 38 [2021-01-07 00:06:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:45,042 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 345 transitions. [2021-01-07 00:06:45,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:06:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 345 transitions. [2021-01-07 00:06:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 00:06:45,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:45,053 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] [2021-01-07 00:06:45,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 00:06:45,053 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:45,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1721724466, now seen corresponding path program 1 times [2021-01-07 00:06:45,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:45,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122683468] [2021-01-07 00:06:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:45,461 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:45,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122683468] [2021-01-07 00:06:45,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:45,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:45,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512431993] [2021-01-07 00:06:45,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:45,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:45,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:45,465 INFO L87 Difference]: Start difference. First operand 275 states and 345 transitions. Second operand 5 states. [2021-01-07 00:06:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:45,662 INFO L93 Difference]: Finished difference Result 496 states and 621 transitions. [2021-01-07 00:06:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:06:45,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-01-07 00:06:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:45,664 INFO L225 Difference]: With dead ends: 496 [2021-01-07 00:06:45,665 INFO L226 Difference]: Without dead ends: 275 [2021-01-07 00:06:45,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:06:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-07 00:06:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-01-07 00:06:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2021-01-07 00:06:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 343 transitions. [2021-01-07 00:06:45,679 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 343 transitions. Word has length 40 [2021-01-07 00:06:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:45,680 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 343 transitions. [2021-01-07 00:06:45,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 343 transitions. [2021-01-07 00:06:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:06:45,681 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:45,681 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:06:45,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 00:06:45,681 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -378295308, now seen corresponding path program 1 times [2021-01-07 00:06:45,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:45,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966388769] [2021-01-07 00:06:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:46,291 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:46,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966388769] [2021-01-07 00:06:46,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:46,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:06:46,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633967947] [2021-01-07 00:06:46,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:06:46,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:46,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:06:46,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:06:46,293 INFO L87 Difference]: Start difference. First operand 275 states and 343 transitions. Second operand 5 states. [2021-01-07 00:06:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:06:51,439 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2021-01-07 00:06:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:06:51,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-01-07 00:06:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:06:51,465 INFO L225 Difference]: With dead ends: 782 [2021-01-07 00:06:51,465 INFO L226 Difference]: Without dead ends: 528 [2021-01-07 00:06:51,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:06:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-01-07 00:06:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 299. [2021-01-07 00:06:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-07 00:06:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 367 transitions. [2021-01-07 00:06:51,486 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 367 transitions. Word has length 42 [2021-01-07 00:06:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:06:51,493 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 367 transitions. [2021-01-07 00:06:51,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:06:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 367 transitions. [2021-01-07 00:06:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:06:51,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:06:51,498 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:06:51,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 00:06:51,499 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:06:51,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:06:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 301763062, now seen corresponding path program 1 times [2021-01-07 00:06:51,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:06:51,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238640038] [2021-01-07 00:06:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:06:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:06:57,447 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:57,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238640038] [2021-01-07 00:06:57,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:06:57,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 00:06:57,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451925734] [2021-01-07 00:06:57,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 00:06:57,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:06:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 00:06:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:06:57,451 INFO L87 Difference]: Start difference. First operand 299 states and 367 transitions. Second operand 12 states. [2021-01-07 00:07:08,252 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2021-01-07 00:07:08,856 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2021-01-07 00:07:09,242 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2021-01-07 00:07:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:11,800 INFO L93 Difference]: Finished difference Result 847 states and 1037 transitions. [2021-01-07 00:07:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 00:07:11,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2021-01-07 00:07:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:11,807 INFO L225 Difference]: With dead ends: 847 [2021-01-07 00:07:11,807 INFO L226 Difference]: Without dead ends: 833 [2021-01-07 00:07:11,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=481, Unknown=0, NotChecked=0, Total=702 [2021-01-07 00:07:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-01-07 00:07:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 510. [2021-01-07 00:07:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2021-01-07 00:07:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 634 transitions. [2021-01-07 00:07:11,845 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 634 transitions. Word has length 42 [2021-01-07 00:07:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:11,845 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 634 transitions. [2021-01-07 00:07:11,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 00:07:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 634 transitions. [2021-01-07 00:07:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:07:11,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:11,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:07:11,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 00:07:11,847 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 559928500, now seen corresponding path program 1 times [2021-01-07 00:07:11,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:11,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302782713] [2021-01-07 00:07:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:12,480 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:12,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302782713] [2021-01-07 00:07:12,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:12,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:07:12,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010310110] [2021-01-07 00:07:12,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:07:12,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:12,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:07:12,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:07:12,486 INFO L87 Difference]: Start difference. First operand 510 states and 634 transitions. Second operand 9 states. [2021-01-07 00:07:21,076 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2021-01-07 00:07:21,997 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2021-01-07 00:07:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:25,326 INFO L93 Difference]: Finished difference Result 1088 states and 1352 transitions. [2021-01-07 00:07:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 00:07:25,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2021-01-07 00:07:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:25,334 INFO L225 Difference]: With dead ends: 1088 [2021-01-07 00:07:25,334 INFO L226 Difference]: Without dead ends: 1072 [2021-01-07 00:07:25,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-01-07 00:07:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-07 00:07:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 763. [2021-01-07 00:07:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2021-01-07 00:07:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 956 transitions. [2021-01-07 00:07:25,378 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 956 transitions. Word has length 42 [2021-01-07 00:07:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:25,379 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 956 transitions. [2021-01-07 00:07:25,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:07:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 956 transitions. [2021-01-07 00:07:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:07:25,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:25,380 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:25,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 00:07:25,381 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1131247120, now seen corresponding path program 1 times [2021-01-07 00:07:25,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:25,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165577132] [2021-01-07 00:07:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:07:26,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165577132] [2021-01-07 00:07:26,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:26,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:07:26,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101663957] [2021-01-07 00:07:26,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:07:26,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:07:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:26,129 INFO L87 Difference]: Start difference. First operand 763 states and 956 transitions. Second operand 10 states. [2021-01-07 00:07:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:33,183 INFO L93 Difference]: Finished difference Result 821 states and 1013 transitions. [2021-01-07 00:07:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:07:33,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2021-01-07 00:07:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:33,189 INFO L225 Difference]: With dead ends: 821 [2021-01-07 00:07:33,189 INFO L226 Difference]: Without dead ends: 814 [2021-01-07 00:07:33,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:07:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-01-07 00:07:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 770. [2021-01-07 00:07:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2021-01-07 00:07:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 964 transitions. [2021-01-07 00:07:33,228 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 964 transitions. Word has length 42 [2021-01-07 00:07:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:33,229 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 964 transitions. [2021-01-07 00:07:33,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:07:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 964 transitions. [2021-01-07 00:07:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 00:07:33,230 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:33,230 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:33,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 00:07:33,230 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -451188750, now seen corresponding path program 1 times [2021-01-07 00:07:33,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:33,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859945531] [2021-01-07 00:07:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:33,615 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:33,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859945531] [2021-01-07 00:07:33,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:33,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:07:33,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068202008] [2021-01-07 00:07:33,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:07:33,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:33,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:07:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:07:33,621 INFO L87 Difference]: Start difference. First operand 770 states and 964 transitions. Second operand 5 states. [2021-01-07 00:07:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:36,942 INFO L93 Difference]: Finished difference Result 1865 states and 2335 transitions. [2021-01-07 00:07:36,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:07:36,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-01-07 00:07:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:36,951 INFO L225 Difference]: With dead ends: 1865 [2021-01-07 00:07:36,951 INFO L226 Difference]: Without dead ends: 1175 [2021-01-07 00:07:36,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:07:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-01-07 00:07:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 770. [2021-01-07 00:07:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2021-01-07 00:07:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 944 transitions. [2021-01-07 00:07:36,996 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 944 transitions. Word has length 42 [2021-01-07 00:07:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:36,997 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 944 transitions. [2021-01-07 00:07:36,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:07:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 944 transitions. [2021-01-07 00:07:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:07:36,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:36,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:07:36,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 00:07:36,998 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 615350763, now seen corresponding path program 1 times [2021-01-07 00:07:36,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:36,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144621144] [2021-01-07 00:07:36,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:37,499 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:37,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144621144] [2021-01-07 00:07:37,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:37,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 00:07:37,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032286383] [2021-01-07 00:07:37,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 00:07:37,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 00:07:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:07:37,502 INFO L87 Difference]: Start difference. First operand 770 states and 944 transitions. Second operand 8 states. [2021-01-07 00:07:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:39,430 INFO L93 Difference]: Finished difference Result 1206 states and 1452 transitions. [2021-01-07 00:07:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 00:07:39,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2021-01-07 00:07:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:39,437 INFO L225 Difference]: With dead ends: 1206 [2021-01-07 00:07:39,438 INFO L226 Difference]: Without dead ends: 1185 [2021-01-07 00:07:39,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:07:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2021-01-07 00:07:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 792. [2021-01-07 00:07:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2021-01-07 00:07:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 965 transitions. [2021-01-07 00:07:39,484 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 965 transitions. Word has length 44 [2021-01-07 00:07:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:39,485 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 965 transitions. [2021-01-07 00:07:39,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 00:07:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 965 transitions. [2021-01-07 00:07:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:07:39,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:39,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:07:39,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 00:07:39,486 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash -193995863, now seen corresponding path program 1 times [2021-01-07 00:07:39,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:39,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393847720] [2021-01-07 00:07:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:40,243 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:40,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393847720] [2021-01-07 00:07:40,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:40,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 00:07:40,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153413502] [2021-01-07 00:07:40,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 00:07:40,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 00:07:40,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:07:40,246 INFO L87 Difference]: Start difference. First operand 792 states and 965 transitions. Second operand 11 states. [2021-01-07 00:07:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:50,119 INFO L93 Difference]: Finished difference Result 2488 states and 2984 transitions. [2021-01-07 00:07:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 00:07:50,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2021-01-07 00:07:50,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:50,128 INFO L225 Difference]: With dead ends: 2488 [2021-01-07 00:07:50,129 INFO L226 Difference]: Without dead ends: 1711 [2021-01-07 00:07:50,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2021-01-07 00:07:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2021-01-07 00:07:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1052. [2021-01-07 00:07:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-07 00:07:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1288 transitions. [2021-01-07 00:07:50,187 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1288 transitions. Word has length 44 [2021-01-07 00:07:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:50,188 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1288 transitions. [2021-01-07 00:07:50,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 00:07:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1288 transitions. [2021-01-07 00:07:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 00:07:50,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:50,189 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] [2021-01-07 00:07:50,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 00:07:50,190 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1878621098, now seen corresponding path program 1 times [2021-01-07 00:07:50,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:50,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161401927] [2021-01-07 00:07:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:50,640 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:50,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161401927] [2021-01-07 00:07:50,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:50,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 00:07:50,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331077700] [2021-01-07 00:07:50,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:07:50,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:07:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:07:50,642 INFO L87 Difference]: Start difference. First operand 1052 states and 1288 transitions. Second operand 7 states. [2021-01-07 00:07:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:07:51,772 INFO L93 Difference]: Finished difference Result 1992 states and 2418 transitions. [2021-01-07 00:07:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:07:51,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-01-07 00:07:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:07:51,782 INFO L225 Difference]: With dead ends: 1992 [2021-01-07 00:07:51,782 INFO L226 Difference]: Without dead ends: 1466 [2021-01-07 00:07:51,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-01-07 00:07:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1052. [2021-01-07 00:07:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2021-01-07 00:07:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1285 transitions. [2021-01-07 00:07:51,860 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1285 transitions. Word has length 46 [2021-01-07 00:07:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:07:51,860 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1285 transitions. [2021-01-07 00:07:51,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:07:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1285 transitions. [2021-01-07 00:07:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:07:51,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:07:51,861 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:51,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 00:07:51,862 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:07:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:07:51,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1567331845, now seen corresponding path program 1 times [2021-01-07 00:07:51,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:07:51,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126937035] [2021-01-07 00:07:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:07:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:07:56,726 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:56,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126937035] [2021-01-07 00:07:56,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:07:56,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:07:56,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440761769] [2021-01-07 00:07:56,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:07:56,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:07:56,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:07:56,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:07:56,728 INFO L87 Difference]: Start difference. First operand 1052 states and 1285 transitions. Second operand 10 states. [2021-01-07 00:08:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:01,133 INFO L93 Difference]: Finished difference Result 1430 states and 1704 transitions. [2021-01-07 00:08:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:08:01,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2021-01-07 00:08:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:01,140 INFO L225 Difference]: With dead ends: 1430 [2021-01-07 00:08:01,141 INFO L226 Difference]: Without dead ends: 1416 [2021-01-07 00:08:01,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:08:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2021-01-07 00:08:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1231. [2021-01-07 00:08:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2021-01-07 00:08:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1509 transitions. [2021-01-07 00:08:01,205 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1509 transitions. Word has length 48 [2021-01-07 00:08:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:01,205 INFO L481 AbstractCegarLoop]: Abstraction has 1231 states and 1509 transitions. [2021-01-07 00:08:01,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:08:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1509 transitions. [2021-01-07 00:08:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:08:01,206 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:01,207 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:08:01,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 00:08:01,207 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash 134321663, now seen corresponding path program 1 times [2021-01-07 00:08:01,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:01,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138306983] [2021-01-07 00:08:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:01,920 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:01,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138306983] [2021-01-07 00:08:01,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:01,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:08:01,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28043912] [2021-01-07 00:08:01,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:08:01,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:08:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:08:01,923 INFO L87 Difference]: Start difference. First operand 1231 states and 1509 transitions. Second operand 9 states. [2021-01-07 00:08:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:09,100 INFO L93 Difference]: Finished difference Result 1520 states and 1848 transitions. [2021-01-07 00:08:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 00:08:09,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2021-01-07 00:08:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:09,109 INFO L225 Difference]: With dead ends: 1520 [2021-01-07 00:08:09,109 INFO L226 Difference]: Without dead ends: 1506 [2021-01-07 00:08:09,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:08:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2021-01-07 00:08:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1459. [2021-01-07 00:08:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2021-01-07 00:08:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1790 transitions. [2021-01-07 00:08:09,223 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1790 transitions. Word has length 48 [2021-01-07 00:08:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:09,223 INFO L481 AbstractCegarLoop]: Abstraction has 1459 states and 1790 transitions. [2021-01-07 00:08:09,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:08:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1790 transitions. [2021-01-07 00:08:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:08:09,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:09,225 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:08:09,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 00:08:09,225 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash 156953917, now seen corresponding path program 1 times [2021-01-07 00:08:09,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:09,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155566694] [2021-01-07 00:08:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:15,670 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2021-01-07 00:08:15,854 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2021-01-07 00:08:16,362 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:16,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155566694] [2021-01-07 00:08:16,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:16,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 00:08:16,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907342490] [2021-01-07 00:08:16,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 00:08:16,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 00:08:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:08:16,367 INFO L87 Difference]: Start difference. First operand 1459 states and 1790 transitions. Second operand 12 states. [2021-01-07 00:08:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:23,815 INFO L93 Difference]: Finished difference Result 1520 states and 1847 transitions. [2021-01-07 00:08:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 00:08:23,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2021-01-07 00:08:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:23,824 INFO L225 Difference]: With dead ends: 1520 [2021-01-07 00:08:23,824 INFO L226 Difference]: Without dead ends: 1513 [2021-01-07 00:08:23,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-01-07 00:08:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2021-01-07 00:08:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1233. [2021-01-07 00:08:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2021-01-07 00:08:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1510 transitions. [2021-01-07 00:08:23,892 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1510 transitions. Word has length 48 [2021-01-07 00:08:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:23,892 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1510 transitions. [2021-01-07 00:08:23,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 00:08:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1510 transitions. [2021-01-07 00:08:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-07 00:08:23,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:23,894 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:08:23,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 00:08:23,894 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1376295925, now seen corresponding path program 1 times [2021-01-07 00:08:23,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:23,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400212838] [2021-01-07 00:08:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:24,091 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:24,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400212838] [2021-01-07 00:08:24,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:24,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:08:24,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442153952] [2021-01-07 00:08:24,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:08:24,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:08:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:08:24,093 INFO L87 Difference]: Start difference. First operand 1233 states and 1510 transitions. Second operand 4 states. [2021-01-07 00:08:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:24,643 INFO L93 Difference]: Finished difference Result 2005 states and 2433 transitions. [2021-01-07 00:08:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:08:24,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-01-07 00:08:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:24,649 INFO L225 Difference]: With dead ends: 2005 [2021-01-07 00:08:24,649 INFO L226 Difference]: Without dead ends: 856 [2021-01-07 00:08:24,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2021-01-07 00:08:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 754. [2021-01-07 00:08:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2021-01-07 00:08:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 906 transitions. [2021-01-07 00:08:24,695 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 906 transitions. Word has length 48 [2021-01-07 00:08:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:24,695 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 906 transitions. [2021-01-07 00:08:24,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:08:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 906 transitions. [2021-01-07 00:08:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 00:08:24,696 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:24,696 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] [2021-01-07 00:08:24,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 00:08:24,697 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:24,697 INFO L82 PathProgramCache]: Analyzing trace with hash 541859832, now seen corresponding path program 1 times [2021-01-07 00:08:24,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:24,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046747226] [2021-01-07 00:08:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:25,409 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:25,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046747226] [2021-01-07 00:08:25,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:25,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:08:25,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079352211] [2021-01-07 00:08:25,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:08:25,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:08:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:08:25,411 INFO L87 Difference]: Start difference. First operand 754 states and 906 transitions. Second operand 10 states. [2021-01-07 00:08:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:34,862 INFO L93 Difference]: Finished difference Result 1199 states and 1395 transitions. [2021-01-07 00:08:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 00:08:34,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2021-01-07 00:08:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:34,870 INFO L225 Difference]: With dead ends: 1199 [2021-01-07 00:08:34,870 INFO L226 Difference]: Without dead ends: 1161 [2021-01-07 00:08:34,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-01-07 00:08:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2021-01-07 00:08:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 840. [2021-01-07 00:08:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2021-01-07 00:08:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1010 transitions. [2021-01-07 00:08:34,920 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1010 transitions. Word has length 50 [2021-01-07 00:08:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:34,920 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 1010 transitions. [2021-01-07 00:08:34,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:08:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1010 transitions. [2021-01-07 00:08:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 00:08:34,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:34,921 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] [2021-01-07 00:08:34,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 00:08:34,922 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 816619446, now seen corresponding path program 1 times [2021-01-07 00:08:34,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:34,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726587561] [2021-01-07 00:08:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:39,600 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:39,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726587561] [2021-01-07 00:08:39,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:39,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 00:08:39,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510914332] [2021-01-07 00:08:39,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 00:08:39,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 00:08:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:08:39,603 INFO L87 Difference]: Start difference. First operand 840 states and 1010 transitions. Second operand 12 states. [2021-01-07 00:08:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:51,111 INFO L93 Difference]: Finished difference Result 1238 states and 1465 transitions. [2021-01-07 00:08:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-01-07 00:08:51,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2021-01-07 00:08:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:51,119 INFO L225 Difference]: With dead ends: 1238 [2021-01-07 00:08:51,119 INFO L226 Difference]: Without dead ends: 1175 [2021-01-07 00:08:51,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=418, Invalid=1388, Unknown=0, NotChecked=0, Total=1806 [2021-01-07 00:08:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-01-07 00:08:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 612. [2021-01-07 00:08:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2021-01-07 00:08:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 733 transitions. [2021-01-07 00:08:51,160 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 733 transitions. Word has length 50 [2021-01-07 00:08:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:51,160 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 733 transitions. [2021-01-07 00:08:51,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 00:08:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 733 transitions. [2021-01-07 00:08:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 00:08:51,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:51,161 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] [2021-01-07 00:08:51,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 00:08:51,162 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:51,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash 38277487, now seen corresponding path program 1 times [2021-01-07 00:08:51,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:51,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652485541] [2021-01-07 00:08:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:51,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652485541] [2021-01-07 00:08:51,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:51,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:08:51,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743834434] [2021-01-07 00:08:51,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:08:51,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:08:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:08:51,515 INFO L87 Difference]: Start difference. First operand 612 states and 733 transitions. Second operand 6 states. [2021-01-07 00:08:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:51,943 INFO L93 Difference]: Finished difference Result 868 states and 1017 transitions. [2021-01-07 00:08:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 00:08:51,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2021-01-07 00:08:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:51,950 INFO L225 Difference]: With dead ends: 868 [2021-01-07 00:08:51,950 INFO L226 Difference]: Without dead ends: 802 [2021-01-07 00:08:51,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:08:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2021-01-07 00:08:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 594. [2021-01-07 00:08:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-07 00:08:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 705 transitions. [2021-01-07 00:08:51,990 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 705 transitions. Word has length 50 [2021-01-07 00:08:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:51,991 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 705 transitions. [2021-01-07 00:08:51,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:08:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 705 transitions. [2021-01-07 00:08:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 00:08:51,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:51,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:08:51,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 00:08:51,992 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:51,993 INFO L82 PathProgramCache]: Analyzing trace with hash -472391190, now seen corresponding path program 1 times [2021-01-07 00:08:51,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:51,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565667329] [2021-01-07 00:08:51,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:52,241 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:52,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565667329] [2021-01-07 00:08:52,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:52,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:08:52,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328584905] [2021-01-07 00:08:52,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:08:52,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:52,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:08:52,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:08:52,244 INFO L87 Difference]: Start difference. First operand 594 states and 705 transitions. Second operand 5 states. [2021-01-07 00:08:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:52,382 INFO L93 Difference]: Finished difference Result 750 states and 879 transitions. [2021-01-07 00:08:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:08:52,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2021-01-07 00:08:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:52,388 INFO L225 Difference]: With dead ends: 750 [2021-01-07 00:08:52,388 INFO L226 Difference]: Without dead ends: 688 [2021-01-07 00:08:52,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:08:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-01-07 00:08:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 562. [2021-01-07 00:08:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-01-07 00:08:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 666 transitions. [2021-01-07 00:08:52,426 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 666 transitions. Word has length 56 [2021-01-07 00:08:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:52,426 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 666 transitions. [2021-01-07 00:08:52,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:08:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 666 transitions. [2021-01-07 00:08:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 00:08:52,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:52,428 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] [2021-01-07 00:08:52,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 00:08:52,428 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -66851802, now seen corresponding path program 1 times [2021-01-07 00:08:52,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:52,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899367577] [2021-01-07 00:08:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:08:52,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899367577] [2021-01-07 00:08:52,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:52,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:08:52,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455636954] [2021-01-07 00:08:52,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:08:52,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:52,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:08:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:08:52,717 INFO L87 Difference]: Start difference. First operand 562 states and 666 transitions. Second operand 6 states. [2021-01-07 00:08:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:08:53,222 INFO L93 Difference]: Finished difference Result 904 states and 1074 transitions. [2021-01-07 00:08:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:08:53,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2021-01-07 00:08:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:08:53,228 INFO L225 Difference]: With dead ends: 904 [2021-01-07 00:08:53,228 INFO L226 Difference]: Without dead ends: 562 [2021-01-07 00:08:53,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:08:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-01-07 00:08:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-01-07 00:08:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-01-07 00:08:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 657 transitions. [2021-01-07 00:08:53,266 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 657 transitions. Word has length 57 [2021-01-07 00:08:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:08:53,266 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 657 transitions. [2021-01-07 00:08:53,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:08:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 657 transitions. [2021-01-07 00:08:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:08:53,267 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:08:53,267 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:08:53,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 00:08:53,268 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:08:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:08:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1969167590, now seen corresponding path program 1 times [2021-01-07 00:08:53,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:08:53,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348695384] [2021-01-07 00:08:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:08:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:08:54,083 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:54,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348695384] [2021-01-07 00:08:54,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:08:54,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 00:08:54,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685068848] [2021-01-07 00:08:54,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 00:08:54,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:08:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 00:08:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-07 00:08:54,094 INFO L87 Difference]: Start difference. First operand 562 states and 657 transitions. Second operand 10 states. [2021-01-07 00:09:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:03,366 INFO L93 Difference]: Finished difference Result 1119 states and 1299 transitions. [2021-01-07 00:09:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 00:09:03,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2021-01-07 00:09:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:03,373 INFO L225 Difference]: With dead ends: 1119 [2021-01-07 00:09:03,374 INFO L226 Difference]: Without dead ends: 691 [2021-01-07 00:09:03,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-01-07 00:09:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-01-07 00:09:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 564. [2021-01-07 00:09:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2021-01-07 00:09:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 659 transitions. [2021-01-07 00:09:03,407 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 659 transitions. Word has length 58 [2021-01-07 00:09:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:03,408 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 659 transitions. [2021-01-07 00:09:03,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 00:09:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 659 transitions. [2021-01-07 00:09:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:09:03,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:03,409 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:09:03,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-07 00:09:03,409 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1711002152, now seen corresponding path program 1 times [2021-01-07 00:09:03,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:03,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102375566] [2021-01-07 00:09:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:07,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102375566] [2021-01-07 00:09:07,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:07,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 00:09:07,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320369093] [2021-01-07 00:09:07,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 00:09:07,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:07,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 00:09:07,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:09:07,367 INFO L87 Difference]: Start difference. First operand 564 states and 659 transitions. Second operand 11 states. [2021-01-07 00:09:16,326 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2021-01-07 00:09:16,529 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-01-07 00:09:16,701 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2021-01-07 00:09:17,107 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2021-01-07 00:09:17,930 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2021-01-07 00:09:18,115 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-01-07 00:09:18,280 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2021-01-07 00:09:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:21,622 INFO L93 Difference]: Finished difference Result 1182 states and 1360 transitions. [2021-01-07 00:09:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 00:09:21,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2021-01-07 00:09:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:21,629 INFO L225 Difference]: With dead ends: 1182 [2021-01-07 00:09:21,629 INFO L226 Difference]: Without dead ends: 752 [2021-01-07 00:09:21,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2021-01-07 00:09:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-01-07 00:09:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 559. [2021-01-07 00:09:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2021-01-07 00:09:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 652 transitions. [2021-01-07 00:09:21,664 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 652 transitions. Word has length 58 [2021-01-07 00:09:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:21,664 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 652 transitions. [2021-01-07 00:09:21,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 00:09:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 652 transitions. [2021-01-07 00:09:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-07 00:09:21,665 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:21,665 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:09:21,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-07 00:09:21,665 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 277991970, now seen corresponding path program 1 times [2021-01-07 00:09:21,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:21,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516539773] [2021-01-07 00:09:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:22,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516539773] [2021-01-07 00:09:22,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:22,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 00:09:22,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443684877] [2021-01-07 00:09:22,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 00:09:22,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 00:09:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:09:22,425 INFO L87 Difference]: Start difference. First operand 559 states and 652 transitions. Second operand 11 states. [2021-01-07 00:09:29,463 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2021-01-07 00:09:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:32,761 INFO L93 Difference]: Finished difference Result 1093 states and 1267 transitions. [2021-01-07 00:09:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 00:09:32,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2021-01-07 00:09:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:32,768 INFO L225 Difference]: With dead ends: 1093 [2021-01-07 00:09:32,769 INFO L226 Difference]: Without dead ends: 677 [2021-01-07 00:09:32,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-01-07 00:09:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-01-07 00:09:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 566. [2021-01-07 00:09:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2021-01-07 00:09:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 658 transitions. [2021-01-07 00:09:32,805 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 658 transitions. Word has length 58 [2021-01-07 00:09:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:32,805 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 658 transitions. [2021-01-07 00:09:32,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 00:09:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 658 transitions. [2021-01-07 00:09:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-07 00:09:32,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:32,806 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] [2021-01-07 00:09:32,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 00:09:32,807 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1170055963, now seen corresponding path program 1 times [2021-01-07 00:09:32,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:32,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634655859] [2021-01-07 00:09:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:33,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634655859] [2021-01-07 00:09:33,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:33,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 00:09:33,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675967923] [2021-01-07 00:09:33,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 00:09:33,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 00:09:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:09:33,859 INFO L87 Difference]: Start difference. First operand 566 states and 658 transitions. Second operand 12 states. [2021-01-07 00:09:47,531 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2021-01-07 00:09:50,169 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-01-07 00:09:50,737 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-01-07 00:09:51,283 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-01-07 00:09:51,736 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-01-07 00:09:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:09:55,647 INFO L93 Difference]: Finished difference Result 1202 states and 1374 transitions. [2021-01-07 00:09:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 00:09:55,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2021-01-07 00:09:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:09:55,656 INFO L225 Difference]: With dead ends: 1202 [2021-01-07 00:09:55,656 INFO L226 Difference]: Without dead ends: 775 [2021-01-07 00:09:55,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2021-01-07 00:09:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-01-07 00:09:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 557. [2021-01-07 00:09:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2021-01-07 00:09:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 647 transitions. [2021-01-07 00:09:55,693 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 647 transitions. Word has length 60 [2021-01-07 00:09:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:09:55,694 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 647 transitions. [2021-01-07 00:09:55,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 00:09:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 647 transitions. [2021-01-07 00:09:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:09:55,695 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:09:55,695 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:09:55,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 00:09:55,695 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:09:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:09:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1289082123, now seen corresponding path program 1 times [2021-01-07 00:09:55,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:09:55,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074148537] [2021-01-07 00:09:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:09:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:09:56,282 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2021-01-07 00:09:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 00:09:56,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074148537] [2021-01-07 00:09:56,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:09:56,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-07 00:09:56,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167691521] [2021-01-07 00:09:56,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 00:09:56,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:09:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 00:09:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-07 00:09:56,761 INFO L87 Difference]: Start difference. First operand 557 states and 647 transitions. Second operand 11 states. [2021-01-07 00:10:03,752 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2021-01-07 00:10:04,656 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-01-07 00:10:04,888 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 38