/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_array_list_pop_back_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:11:08,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:11:08,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:11:08,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:11:08,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:11:08,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:11:08,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:11:08,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:11:08,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:11:08,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:11:08,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:11:08,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:11:08,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:11:08,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:11:08,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:11:08,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:11:08,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:11:08,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:11:08,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:11:08,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:11:08,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:11:08,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:11:08,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:11:08,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:11:08,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:11:08,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:11:08,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:11:08,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:11:08,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:11:08,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:11:08,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:11:08,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:11:08,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:11:08,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:11:08,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:11:08,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:11:08,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:11:08,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:11:08,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:11:08,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:11:08,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:11:08,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:11:08,761 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:11:08,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:11:08,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:11:08,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:11:08,767 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:11:08,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:11:08,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:11:08,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:11:08,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:11:08,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:11:08,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:11:08,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:11:08,770 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:11:08,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:11:08,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:11:08,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:11:08,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:11:08,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:11:08,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:11:08,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:11:08,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:11:08,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:11:08,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:11:08,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:11:08,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:11:08,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 14:11:09,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:11:09,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:11:09,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:11:09,262 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:11:09,263 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:11:09,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_pop_back_harness.i [2020-12-23 14:11:09,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f04350b46/0ab1faf712f14fa2857dc28243028e7a/FLAGa352e8abb [2020-12-23 14:11:10,332 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:11:10,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_pop_back_harness.i [2020-12-23 14:11:10,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f04350b46/0ab1faf712f14fa2857dc28243028e7a/FLAGa352e8abb [2020-12-23 14:11:10,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f04350b46/0ab1faf712f14fa2857dc28243028e7a [2020-12-23 14:11:10,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:11:10,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:11:10,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:11:10,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:11:10,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:11:10,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:11:10" (1/1) ... [2020-12-23 14:11:10,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcc9295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:10, skipping insertion in model container [2020-12-23 14:11:10,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:11:10" (1/1) ... [2020-12-23 14:11:10,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:11:11,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 14:11:11,341 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_array_list_pop_back_harness.i[4497,4510] [2020-12-23 14:11:11,351 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_array_list_pop_back_harness.i[4557,4570] [2020-12-23 14:11:11,386 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:11:11,397 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2020-12-23 14:11:12,813 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:11:12,939 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,940 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,941 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,941 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,946 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:11:12,971 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,972 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,976 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,977 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2020-12-23 14:11:12,979 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,981 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,983 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:12,987 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem374,],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~mem385,],base],StructAccessExpression[IdentifierExpression[#t~mem385,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem386,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem386,],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~mem397,],base],StructAccessExpression[IdentifierExpression[#t~mem397,],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~mem404,],base],StructAccessExpression[IdentifierExpression[#t~mem404,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem406,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem406,],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~mem450,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem450,],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~mem452,],base],StructAccessExpression[IdentifierExpression[#t~mem452,],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~mem453,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem453,],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~mem454,],base],StructAccessExpression[IdentifierExpression[#t~mem454,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:11:13,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:11:13,412 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:11:13,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:11:13,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:11:13,415 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:11:13,416 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:11:13,416 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:11:13,417 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:11:13,418 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:11:13,418 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem577,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem577,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem580,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem580,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] [2020-12-23 14:11:13,553 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~raw_data~0,] 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[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],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[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to,],offset]]]] [2020-12-23 14:11:13,561 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[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: lhs: VariableLHS[~item1,] left hand side expression in assignment: lhs: VariableLHS[~item2,] [2020-12-23 14:11:13,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:11:13,646 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 14:11:13,664 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_array_list_pop_back_harness.i[4497,4510] [2020-12-23 14:11:13,665 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_array_list_pop_back_harness.i[4557,4570] [2020-12-23 14:11:13,667 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:11:13,668 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2020-12-23 14:11:13,702 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:11:13,722 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,722 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,723 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,723 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,724 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:11:13,732 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,733 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,734 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,734 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] [2020-12-23 14:11:13,736 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,736 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,737 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:11:13,737 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem388,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem388,],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~mem399,],base],StructAccessExpression[IdentifierExpression[#t~mem399,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem400,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem400,],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[#t~mem402,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem402,],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~mem415,],base],StructAccessExpression[IdentifierExpression[#t~mem415,],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~mem422,],base],StructAccessExpression[IdentifierExpression[#t~mem422,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem424,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem424,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem468,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem468,],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~mem470,],base],StructAccessExpression[IdentifierExpression[#t~mem470,],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~mem471,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem471,],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~mem472,],base],StructAccessExpression[IdentifierExpression[#t~mem472,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:11:13,791 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:11:13,792 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:11:13,793 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:11:13,795 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:11:13,796 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:11:13,797 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:11:13,797 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:11:13,798 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:11:13,806 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:11:13,807 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem595,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem595,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem598,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem598,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] [2020-12-23 14:11:13,893 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: lhs: VariableLHS[~raw_data~0,] 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[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~to,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],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[~to,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to,],offset]]]] [2020-12-23 14:11:13,900 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[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: lhs: VariableLHS[~item1,] left hand side expression in assignment: lhs: VariableLHS[~item2,] [2020-12-23 14:11:13,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:11:14,951 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:11:14,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14 WrapperNode [2020-12-23 14:11:14,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:11:14,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:11:14,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:11:14,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:11:14,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:11:15,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:11:15,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:11:15,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:11:15,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... [2020-12-23 14:11:15,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:11:15,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:11:15,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:11:15,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:11:15,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:11:15,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:11:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:11:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:11:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:11:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:11:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:11:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:11:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2020-12-23 14:11:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:11:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:11:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:11:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:11:25,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:11:25,597 INFO L299 CfgBuilder]: Removed 205 assume(true) statements. [2020-12-23 14:11:25,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:11:25 BoogieIcfgContainer [2020-12-23 14:11:25,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:11:25,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:11:25,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:11:25,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:11:25,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:11:10" (1/3) ... [2020-12-23 14:11:25,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec90220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:11:25, skipping insertion in model container [2020-12-23 14:11:25,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:14" (2/3) ... [2020-12-23 14:11:25,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec90220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:11:25, skipping insertion in model container [2020-12-23 14:11:25,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:11:25" (3/3) ... [2020-12-23 14:11:25,611 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_list_pop_back_harness.i [2020-12-23 14:11:25,619 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:11:25,636 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-12-23 14:11:25,660 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-12-23 14:11:25,695 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:11:25,695 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:11:25,695 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:11:25,695 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:11:25,696 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:11:25,696 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:11:25,696 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:11:25,696 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:11:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2020-12-23 14:11:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 14:11:25,732 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:25,733 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] [2020-12-23 14:11:25,734 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1102187548, now seen corresponding path program 1 times [2020-12-23 14:11:25,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:25,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396131515] [2020-12-23 14:11:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:11:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:11:26,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396131515] [2020-12-23 14:11:26,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:11:26,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:11:26,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443310090] [2020-12-23 14:11:26,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 14:11:26,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:11:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 14:11:26,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:11:26,554 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 2 states. [2020-12-23 14:11:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:11:26,604 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2020-12-23 14:11:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 14:11:26,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-12-23 14:11:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:11:26,621 INFO L225 Difference]: With dead ends: 504 [2020-12-23 14:11:26,622 INFO L226 Difference]: Without dead ends: 249 [2020-12-23 14:11:26,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:11:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-12-23 14:11:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2020-12-23 14:11:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-12-23 14:11:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2020-12-23 14:11:26,709 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 33 [2020-12-23 14:11:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:11:26,709 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2020-12-23 14:11:26,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 14:11:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2020-12-23 14:11:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 14:11:26,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:26,712 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] [2020-12-23 14:11:26,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:11:26,713 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -977674992, now seen corresponding path program 1 times [2020-12-23 14:11:26,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:26,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641944866] [2020-12-23 14:11:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:11:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:11:27,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641944866] [2020-12-23 14:11:27,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:11:27,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:11:27,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244087445] [2020-12-23 14:11:27,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:11:27,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:11:27,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:11:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:11:27,061 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand 3 states. [2020-12-23 14:11:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:11:27,127 INFO L93 Difference]: Finished difference Result 485 states and 597 transitions. [2020-12-23 14:11:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:11:27,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-23 14:11:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:11:27,133 INFO L225 Difference]: With dead ends: 485 [2020-12-23 14:11:27,134 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 14:11:27,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:11:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 14:11:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2020-12-23 14:11:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 14:11:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2020-12-23 14:11:27,154 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 33 [2020-12-23 14:11:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:11:27,154 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2020-12-23 14:11:27,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:11:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2020-12-23 14:11:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 14:11:27,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:27,156 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] [2020-12-23 14:11:27,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:11:27,157 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash -468201902, now seen corresponding path program 1 times [2020-12-23 14:11:27,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:27,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579515459] [2020-12-23 14:11:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:11:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:11:27,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579515459] [2020-12-23 14:11:27,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:11:27,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:11:27,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602944685] [2020-12-23 14:11:27,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:11:27,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:11:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:11:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:11:27,528 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand 4 states. [2020-12-23 14:11:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:11:27,888 INFO L93 Difference]: Finished difference Result 468 states and 574 transitions. [2020-12-23 14:11:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:11:27,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-23 14:11:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:11:27,891 INFO L225 Difference]: With dead ends: 468 [2020-12-23 14:11:27,891 INFO L226 Difference]: Without dead ends: 250 [2020-12-23 14:11:27,895 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 [2020-12-23 14:11:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-12-23 14:11:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2020-12-23 14:11:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 14:11:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 304 transitions. [2020-12-23 14:11:27,921 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 304 transitions. Word has length 33 [2020-12-23 14:11:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:11:27,922 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 304 transitions. [2020-12-23 14:11:27,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:11:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 304 transitions. [2020-12-23 14:11:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 14:11:27,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:27,924 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] [2020-12-23 14:11:27,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:11:27,925 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash 721547164, now seen corresponding path program 1 times [2020-12-23 14:11:27,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:27,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636730037] [2020-12-23 14:11:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:28,069 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:11:28,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045567593] [2020-12-23 14:11:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:11:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:11:29,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:11:29,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:11:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:11:29,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636730037] [2020-12-23 14:11:29,480 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:11:29,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045567593] [2020-12-23 14:11:29,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:11:29,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:11:29,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007309566] [2020-12-23 14:11:29,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:11:29,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:11:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:11:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:11:29,483 INFO L87 Difference]: Start difference. First operand 250 states and 304 transitions. Second operand 4 states. [2020-12-23 14:11:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:11:29,858 INFO L93 Difference]: Finished difference Result 514 states and 633 transitions. [2020-12-23 14:11:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:11:29,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-23 14:11:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:11:29,861 INFO L225 Difference]: With dead ends: 514 [2020-12-23 14:11:29,861 INFO L226 Difference]: Without dead ends: 295 [2020-12-23 14:11:29,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:11:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-12-23 14:11:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 268. [2020-12-23 14:11:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-23 14:11:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2020-12-23 14:11:29,874 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 49 [2020-12-23 14:11:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:11:29,875 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2020-12-23 14:11:29,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:11:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2020-12-23 14:11:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-23 14:11:29,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:29,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:11:30,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:11:30,091 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1884476390, now seen corresponding path program 1 times [2020-12-23 14:11:30,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:30,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803863413] [2020-12-23 14:11:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:30,200 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:11:30,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128153980] [2020-12-23 14:11:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:11:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:11:31,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 14:11:31,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:11:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:11:31,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803863413] [2020-12-23 14:11:31,631 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:11:31,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128153980] [2020-12-23 14:11:31,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:11:31,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:11:31,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853708405] [2020-12-23 14:11:31,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:11:31,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:11:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:11:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:11:31,637 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 7 states. [2020-12-23 14:11:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:11:32,108 INFO L93 Difference]: Finished difference Result 457 states and 547 transitions. [2020-12-23 14:11:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 14:11:32,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2020-12-23 14:11:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:11:32,111 INFO L225 Difference]: With dead ends: 457 [2020-12-23 14:11:32,111 INFO L226 Difference]: Without dead ends: 268 [2020-12-23 14:11:32,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 14:11:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-12-23 14:11:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2020-12-23 14:11:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-23 14:11:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 316 transitions. [2020-12-23 14:11:32,126 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 316 transitions. Word has length 49 [2020-12-23 14:11:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:11:32,126 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 316 transitions. [2020-12-23 14:11:32,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:11:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 316 transitions. [2020-12-23 14:11:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 14:11:32,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:11:32,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:11:32,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:11:32,345 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:11:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:11:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1740025118, now seen corresponding path program 1 times [2020-12-23 14:11:32,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:11:32,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006689238] [2020-12-23 14:11:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:11:32,527 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:11:32,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199865239] [2020-12-23 14:11:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:14:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:14:22,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 294 conjunts are in the unsatisfiable core [2020-12-23 14:14:22,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:14:22,551 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 14:14:22,552 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:22,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:22,565 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:14:22,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 14:14:22,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:22,779 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-23 14:14:22,782 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:22,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:22,803 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:14:22,803 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2020-12-23 14:14:23,121 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-23 14:14:23,123 INFO L348 Elim1Store]: treesize reduction 13, result has 83.5 percent of original size [2020-12-23 14:14:23,124 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 84 [2020-12-23 14:14:23,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:23,140 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:23,324 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-12-23 14:14:23,325 INFO L625 ElimStorePlain]: treesize reduction 8, result has 90.7 percent of original size [2020-12-23 14:14:23,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 14:14:23,329 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2020-12-23 14:14:23,502 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 14:14:23,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:23,507 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2020-12-23 14:14:23,514 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:23,568 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:23,571 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 14:14:23,572 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:68 [2020-12-23 14:14:24,473 WARN L197 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-12-23 14:14:24,982 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:24,983 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2020-12-23 14:14:24,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:25,080 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:25,081 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2020-12-23 14:14:25,087 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:25,167 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:25,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2020-12-23 14:14:25,172 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:25,537 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-12-23 14:14:25,538 INFO L625 ElimStorePlain]: treesize reduction 120, result has 57.0 percent of original size [2020-12-23 14:14:25,547 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-12-23 14:14:25,548 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:273, output treesize:159 [2020-12-23 14:14:25,769 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-23 14:14:26,034 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-23 14:14:26,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:14:26,644 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-12-23 14:14:26,647 INFO L348 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2020-12-23 14:14:26,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 102 [2020-12-23 14:14:26,655 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:26,876 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-12-23 14:14:26,880 INFO L625 ElimStorePlain]: treesize reduction 37, result has 75.5 percent of original size [2020-12-23 14:14:26,886 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,888 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,892 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,894 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,897 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,901 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 14:14:26,905 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:26,908 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,912 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,917 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,920 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:26,942 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:26,947 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,951 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,953 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:26,971 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:26,973 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:26,976 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:26,981 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:26,998 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 14:14:26,998 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:91, output treesize:114 [2020-12-23 14:14:27,014 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,015 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,021 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,022 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,024 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,027 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 14:14:27,029 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,031 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,032 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,033 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,053 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,055 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,058 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,059 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:27,071 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,072 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,075 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,076 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:27,242 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,243 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,246 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,247 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,250 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,252 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 14:14:27,255 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,258 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,260 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,264 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,266 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,300 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,303 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,306 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,307 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:27,321 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,322 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,326 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,328 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:27,610 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,611 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,613 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,613 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,615 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,618 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 14:14:27,620 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,625 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,627 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,628 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,629 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:27,639 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,641 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,642 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,645 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-12-23 14:14:27,661 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 14:14:27,663 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 14:14:27,665 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 14:14:27,667 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-12-23 14:14:29,730 WARN L197 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2020-12-23 14:14:29,757 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-23 14:14:29,852 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:29,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 14:14:29,860 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:29,916 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:29,917 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 14:14:29,919 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:30,000 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:30,000 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 14:14:30,002 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:30,061 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:30,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2020-12-23 14:14:30,064 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:30,576 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-12-23 14:14:30,577 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:30,588 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-12-23 14:14:30,589 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:489, output treesize:401 [2020-12-23 14:14:30,996 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2020-12-23 14:14:31,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:31,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:31,027 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 14:14:31,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:31,029 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 14:14:31,052 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:31,053 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 93 [2020-12-23 14:14:31,056 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:31,177 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2020-12-23 14:14:31,178 INFO L625 ElimStorePlain]: treesize reduction 34, result has 75.2 percent of original size [2020-12-23 14:14:31,182 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 14:14:31,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:99, output treesize:103 [2020-12-23 14:14:31,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:14:31,738 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2020-12-23 14:14:32,248 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-23 14:14:34,559 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-23 14:14:34,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:14:36,964 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 38 [2020-12-23 14:14:39,618 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 41 [2020-12-23 14:14:39,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:39,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:39,955 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 14:14:39,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:39,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:39,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:14:40,001 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:14:40,002 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 102 [2020-12-23 14:14:40,008 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:14:46,278 WARN L197 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-12-23 14:14:46,278 INFO L625 ElimStorePlain]: treesize reduction 18, result has 87.3 percent of original size [2020-12-23 14:14:46,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:14:46,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:14:46,339 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-23 14:14:46,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:104, output treesize:124 [2020-12-23 14:14:46,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:14:46,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:46,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:14:54,679 WARN L197 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-23 14:14:54,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:54,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:54,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:14:54,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:14:54,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:01,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:01,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:01,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:01,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:01,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:07,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:07,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:07,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:07,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:07,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:14,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:14,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:14,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:14,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:14,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:19,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:19,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:19,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:19,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:19,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 14:15:27,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:27,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:27,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 14:15:27,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:15:27,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts