/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:16:50,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:16:50,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:16:50,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:16:50,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:16:50,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:16:50,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:16:50,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:16:50,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:16:50,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:16:50,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:16:50,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:16:50,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:16:50,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:16:50,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:16:50,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:16:50,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:16:50,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:16:50,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:16:50,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:16:50,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:16:50,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:16:50,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:16:50,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:16:50,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:16:50,886 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:16:50,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:16:50,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:16:50,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:16:50,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:16:50,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:16:50,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:16:50,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:16:50,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:16:50,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:16:50,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:16:50,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:16:50,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:16:50,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:16:50,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:16:50,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:16:50,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:16:50,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:16:50,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:16:50,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:16:50,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:16:50,944 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:16:50,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:16:50,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:16:50,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:16:50,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:16:50,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:16:50,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:16:50,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:16:50,948 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:16:50,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:16:50,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:16:50,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:16:50,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:16:50,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:16:50,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:16:50,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:16:50,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:16:50,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:16:50,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:16:50,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:16:50,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:16:50,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 14:16:51,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:16:51,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:16:51,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:16:51,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:16:51,455 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:16:51,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2020-12-23 14:16:51,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7aece4f19/fe7220d57c4d4882aa5606ce788795d9/FLAG5c08ee242 [2020-12-23 14:16:52,798 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:16:52,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2020-12-23 14:16:52,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7aece4f19/fe7220d57c4d4882aa5606ce788795d9/FLAG5c08ee242 [2020-12-23 14:16:53,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7aece4f19/fe7220d57c4d4882aa5606ce788795d9 [2020-12-23 14:16:53,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:16:53,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:16:53,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:16:53,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:16:53,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:16:53,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:16:53" (1/1) ... [2020-12-23 14:16:53,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2a0911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:53, skipping insertion in model container [2020-12-23 14:16:53,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:16:53" (1/1) ... [2020-12-23 14:16:53,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:16:53,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 14:16:53,805 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2020-12-23 14:16:53,816 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2020-12-23 14:16:53,850 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:16:53,857 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2020-12-23 14:16:55,253 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:16:55,357 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,359 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,360 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,361 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,362 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:16:55,381 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,383 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,385 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:55,386 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem348,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem348,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem359,],base],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem360,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem360,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],base],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem371,],base],StructAccessExpression[IdentifierExpression[#t~mem371,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem378,],base],StructAccessExpression[IdentifierExpression[#t~mem378,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem380,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem380,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem424,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem424,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem426,],base],StructAccessExpression[IdentifierExpression[#t~mem426,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem427,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem427,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem428,],base],StructAccessExpression[IdentifierExpression[#t~mem428,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:16:55,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:16:55,942 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:16:55,943 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:16:55,945 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:16:55,948 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:16:55,949 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:16:55,950 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:16:55,951 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:16:55,952 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:16:55,953 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem551,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem551,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem554,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem554,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2020-12-23 14:16:56,182 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,183 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:16:56,380 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 14:16:56,418 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2020-12-23 14:16:56,420 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2020-12-23 14:16:56,429 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-23 14:16:56,431 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2020-12-23 14:16:56,541 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2020-12-23 14:16:56,593 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,593 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,595 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,596 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,597 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2020-12-23 14:16:56,617 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,618 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,624 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,625 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem362,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem362,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem373,],base],StructAccessExpression[IdentifierExpression[#t~mem373,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem374,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem375,],base],StructAccessExpression[IdentifierExpression[#t~mem375,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem376,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem389,],base],StructAccessExpression[IdentifierExpression[#t~mem389,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem396,],base],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem398,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem398,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem442,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem442,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem444,],base],StructAccessExpression[IdentifierExpression[#t~mem444,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem445,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem445,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem446,],base],StructAccessExpression[IdentifierExpression[#t~mem446,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2020-12-23 14:16:56,715 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-23 14:16:56,717 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-23 14:16:56,719 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-23 14:16:56,721 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-23 14:16:56,725 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-23 14:16:56,726 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-23 14:16:56,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-23 14:16:56,727 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-23 14:16:56,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-23 14:16:56,728 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem569,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem569,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem572,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem572,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2020-12-23 14:16:56,801 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,802 WARN L1512 CHandler]: Possible shadowing of function index [2020-12-23 14:16:56,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:16:58,028 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:16:58,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58 WrapperNode [2020-12-23 14:16:58,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:16:58,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:16:58,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:16:58,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:16:58,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:16:58,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:16:58,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:16:58,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:16:58,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... [2020-12-23 14:16:58,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:16:58,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:16:58,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:16:58,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:16:58,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:16:58,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:16:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:16:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:16:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:16:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:16:58,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:16:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:16:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2020-12-23 14:16:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:16:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:16:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:16:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:17:09,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:17:09,854 INFO L299 CfgBuilder]: Removed 188 assume(true) statements. [2020-12-23 14:17:09,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:17:09 BoogieIcfgContainer [2020-12-23 14:17:09,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:17:09,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:17:09,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:17:09,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:17:09,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:16:53" (1/3) ... [2020-12-23 14:17:09,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:17:09, skipping insertion in model container [2020-12-23 14:17:09,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:16:58" (2/3) ... [2020-12-23 14:17:09,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:17:09, skipping insertion in model container [2020-12-23 14:17:09,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:17:09" (3/3) ... [2020-12-23 14:17:09,874 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2020-12-23 14:17:09,883 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:17:09,891 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-12-23 14:17:09,916 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-12-23 14:17:09,967 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:17:09,968 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:17:09,968 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:17:09,968 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:17:09,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:17:09,968 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:17:09,969 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:17:09,969 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:17:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2020-12-23 14:17:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 14:17:10,022 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:10,023 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] [2020-12-23 14:17:10,026 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1385932008, now seen corresponding path program 1 times [2020-12-23 14:17:10,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:10,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085014342] [2020-12-23 14:17:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:11,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085014342] [2020-12-23 14:17:11,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:11,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 14:17:11,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535749535] [2020-12-23 14:17:11,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 14:17:11,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 14:17:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 14:17:11,173 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 2 states. [2020-12-23 14:17:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:11,269 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2020-12-23 14:17:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 14:17:11,272 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2020-12-23 14:17:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:11,295 INFO L225 Difference]: With dead ends: 486 [2020-12-23 14:17:11,296 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 14:17:11,304 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:17:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 14:17:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-12-23 14:17:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 298 transitions. [2020-12-23 14:17:11,403 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 298 transitions. Word has length 40 [2020-12-23 14:17:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:11,404 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 298 transitions. [2020-12-23 14:17:11,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 14:17:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 298 transitions. [2020-12-23 14:17:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 14:17:11,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:11,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:11,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:17:11,410 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 577264856, now seen corresponding path program 1 times [2020-12-23 14:17:11,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:11,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162369523] [2020-12-23 14:17:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:11,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162369523] [2020-12-23 14:17:11,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:11,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:11,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111265538] [2020-12-23 14:17:11,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:11,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:11,945 INFO L87 Difference]: Start difference. First operand 239 states and 298 transitions. Second operand 4 states. [2020-12-23 14:17:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:12,041 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2020-12-23 14:17:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:17:12,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-23 14:17:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:12,044 INFO L225 Difference]: With dead ends: 398 [2020-12-23 14:17:12,044 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 14:17:12,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 14:17:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-12-23 14:17:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2020-12-23 14:17:12,065 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 40 [2020-12-23 14:17:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:12,066 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2020-12-23 14:17:12,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2020-12-23 14:17:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 14:17:12,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:12,068 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] [2020-12-23 14:17:12,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:17:12,069 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -252060921, now seen corresponding path program 1 times [2020-12-23 14:17:12,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:12,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080090911] [2020-12-23 14:17:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:12,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080090911] [2020-12-23 14:17:12,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:12,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:17:12,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202692955] [2020-12-23 14:17:12,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:17:12,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:17:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:12,638 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand 5 states. [2020-12-23 14:17:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:13,058 INFO L93 Difference]: Finished difference Result 509 states and 617 transitions. [2020-12-23 14:17:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:13,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-12-23 14:17:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:13,063 INFO L225 Difference]: With dead ends: 509 [2020-12-23 14:17:13,064 INFO L226 Difference]: Without dead ends: 318 [2020-12-23 14:17:13,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:17:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-12-23 14:17:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 239. [2020-12-23 14:17:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 294 transitions. [2020-12-23 14:17:13,114 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 294 transitions. Word has length 44 [2020-12-23 14:17:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:13,115 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 294 transitions. [2020-12-23 14:17:13,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:17:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 294 transitions. [2020-12-23 14:17:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 14:17:13,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:13,118 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] [2020-12-23 14:17:13,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:17:13,118 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:13,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1945926435, now seen corresponding path program 1 times [2020-12-23 14:17:13,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:13,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51297058] [2020-12-23 14:17:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:13,302 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:13,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942735869] [2020-12-23 14:17:13,303 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:17:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:14,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 14:17:14,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:15,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51297058] [2020-12-23 14:17:15,157 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:15,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942735869] [2020-12-23 14:17:15,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:15,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:17:15,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102620576] [2020-12-23 14:17:15,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:17:15,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:17:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:17:15,162 INFO L87 Difference]: Start difference. First operand 239 states and 294 transitions. Second operand 6 states. [2020-12-23 14:17:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:15,448 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2020-12-23 14:17:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:17:15,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-12-23 14:17:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:15,451 INFO L225 Difference]: With dead ends: 399 [2020-12-23 14:17:15,452 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 14:17:15,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:17:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 14:17:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-12-23 14:17:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 292 transitions. [2020-12-23 14:17:15,477 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 292 transitions. Word has length 52 [2020-12-23 14:17:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:15,477 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 292 transitions. [2020-12-23 14:17:15,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:17:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 292 transitions. [2020-12-23 14:17:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 14:17:15,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:15,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:15,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:15,695 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash -909602284, now seen corresponding path program 1 times [2020-12-23 14:17:15,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:15,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729103767] [2020-12-23 14:17:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:15,884 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:15,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368314185] [2020-12-23 14:17:15,886 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:17:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:17,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 14:17:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:17,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729103767] [2020-12-23 14:17:17,545 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:17,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368314185] [2020-12-23 14:17:17,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:17,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:17:17,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365435991] [2020-12-23 14:17:17,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 14:17:17,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 14:17:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:17:17,547 INFO L87 Difference]: Start difference. First operand 239 states and 292 transitions. Second operand 7 states. [2020-12-23 14:17:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:18,058 INFO L93 Difference]: Finished difference Result 415 states and 506 transitions. [2020-12-23 14:17:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:17:18,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2020-12-23 14:17:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:18,061 INFO L225 Difference]: With dead ends: 415 [2020-12-23 14:17:18,061 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 14:17:18,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-23 14:17:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 14:17:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-12-23 14:17:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 290 transitions. [2020-12-23 14:17:18,076 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 290 transitions. Word has length 64 [2020-12-23 14:17:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:18,077 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 290 transitions. [2020-12-23 14:17:18,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 14:17:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 290 transitions. [2020-12-23 14:17:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 14:17:18,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:18,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:18,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:18,293 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1743581048, now seen corresponding path program 1 times [2020-12-23 14:17:18,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:18,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168974339] [2020-12-23 14:17:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:18,434 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:18,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273099818] [2020-12-23 14:17:18,434 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:17:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:19,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 14:17:19,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:20,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168974339] [2020-12-23 14:17:20,147 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:20,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273099818] [2020-12-23 14:17:20,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:20,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:17:20,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375141628] [2020-12-23 14:17:20,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:17:20,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:17:20,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:20,150 INFO L87 Difference]: Start difference. First operand 239 states and 290 transitions. Second operand 5 states. [2020-12-23 14:17:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:20,433 INFO L93 Difference]: Finished difference Result 368 states and 441 transitions. [2020-12-23 14:17:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:20,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 14:17:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:20,436 INFO L225 Difference]: With dead ends: 368 [2020-12-23 14:17:20,436 INFO L226 Difference]: Without dead ends: 239 [2020-12-23 14:17:20,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:17:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-12-23 14:17:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2020-12-23 14:17:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-12-23 14:17:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 288 transitions. [2020-12-23 14:17:20,451 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 288 transitions. Word has length 72 [2020-12-23 14:17:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:20,452 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 288 transitions. [2020-12-23 14:17:20,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:17:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 288 transitions. [2020-12-23 14:17:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:20,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:20,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:20,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:20,669 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1843556290, now seen corresponding path program 1 times [2020-12-23 14:17:20,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:20,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695799107] [2020-12-23 14:17:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:20,850 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:20,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461509792] [2020-12-23 14:17:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:22,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:17:22,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:22,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695799107] [2020-12-23 14:17:22,380 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:22,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461509792] [2020-12-23 14:17:22,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:22,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:22,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332110140] [2020-12-23 14:17:22,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:22,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:22,382 INFO L87 Difference]: Start difference. First operand 239 states and 288 transitions. Second operand 4 states. [2020-12-23 14:17:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:22,656 INFO L93 Difference]: Finished difference Result 461 states and 561 transitions. [2020-12-23 14:17:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:22,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 14:17:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:22,659 INFO L225 Difference]: With dead ends: 461 [2020-12-23 14:17:22,660 INFO L226 Difference]: Without dead ends: 269 [2020-12-23 14:17:22,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-12-23 14:17:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2020-12-23 14:17:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-12-23 14:17:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2020-12-23 14:17:22,676 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 88 [2020-12-23 14:17:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:22,676 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2020-12-23 14:17:22,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2020-12-23 14:17:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:22,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:22,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:22,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:22,893 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash 68548928, now seen corresponding path program 1 times [2020-12-23 14:17:22,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:22,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544409172] [2020-12-23 14:17:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:23,080 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:23,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986730404] [2020-12-23 14:17:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-23 14:17:24,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:24,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544409172] [2020-12-23 14:17:24,698 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:24,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986730404] [2020-12-23 14:17:24,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:24,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:17:24,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877627549] [2020-12-23 14:17:24,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:17:24,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:24,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:17:24,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:17:24,701 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 6 states. [2020-12-23 14:17:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:25,031 INFO L93 Difference]: Finished difference Result 589 states and 693 transitions. [2020-12-23 14:17:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:17:25,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2020-12-23 14:17:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:25,037 INFO L225 Difference]: With dead ends: 589 [2020-12-23 14:17:25,037 INFO L226 Difference]: Without dead ends: 420 [2020-12-23 14:17:25,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 14:17:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-12-23 14:17:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 263. [2020-12-23 14:17:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-12-23 14:17:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-12-23 14:17:25,057 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 88 [2020-12-23 14:17:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:25,057 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-12-23 14:17:25,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:17:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-12-23 14:17:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:25,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:25,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:25,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:25,268 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:25,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2117936770, now seen corresponding path program 1 times [2020-12-23 14:17:25,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:25,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685610268] [2020-12-23 14:17:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:25,390 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:25,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816091791] [2020-12-23 14:17:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:26,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 14:17:26,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:26,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:17:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:27,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685610268] [2020-12-23 14:17:27,035 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:27,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816091791] [2020-12-23 14:17:27,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:27,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:17:27,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756581555] [2020-12-23 14:17:27,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:17:27,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:17:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:17:27,038 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 6 states. [2020-12-23 14:17:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:34,379 INFO L93 Difference]: Finished difference Result 621 states and 741 transitions. [2020-12-23 14:17:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:17:34,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2020-12-23 14:17:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:34,383 INFO L225 Difference]: With dead ends: 621 [2020-12-23 14:17:34,383 INFO L226 Difference]: Without dead ends: 437 [2020-12-23 14:17:34,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:17:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-12-23 14:17:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 271. [2020-12-23 14:17:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-12-23 14:17:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 326 transitions. [2020-12-23 14:17:34,401 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 326 transitions. Word has length 88 [2020-12-23 14:17:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:34,402 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 326 transitions. [2020-12-23 14:17:34,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:17:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 326 transitions. [2020-12-23 14:17:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:34,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:34,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:34,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:34,615 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1928884032, now seen corresponding path program 1 times [2020-12-23 14:17:34,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:34,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863925392] [2020-12-23 14:17:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:34,756 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:34,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196217241] [2020-12-23 14:17:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:36,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:17:36,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:36,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863925392] [2020-12-23 14:17:36,307 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:36,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196217241] [2020-12-23 14:17:36,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:36,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:36,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728001086] [2020-12-23 14:17:36,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:36,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:36,312 INFO L87 Difference]: Start difference. First operand 271 states and 326 transitions. Second operand 4 states. [2020-12-23 14:17:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:36,424 INFO L93 Difference]: Finished difference Result 475 states and 568 transitions. [2020-12-23 14:17:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:36,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 14:17:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:36,428 INFO L225 Difference]: With dead ends: 475 [2020-12-23 14:17:36,428 INFO L226 Difference]: Without dead ends: 287 [2020-12-23 14:17:36,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-23 14:17:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2020-12-23 14:17:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-12-23 14:17:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 334 transitions. [2020-12-23 14:17:36,449 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 334 transitions. Word has length 88 [2020-12-23 14:17:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:36,449 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 334 transitions. [2020-12-23 14:17:36,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 334 transitions. [2020-12-23 14:17:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:36,451 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:36,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:36,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 14:17:36,666 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 994275966, now seen corresponding path program 1 times [2020-12-23 14:17:36,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:36,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321242072] [2020-12-23 14:17:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:36,781 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:36,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386332961] [2020-12-23 14:17:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:38,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 40 conjunts are in the unsatisfiable core [2020-12-23 14:17:38,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:38,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321242072] [2020-12-23 14:17:38,811 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:38,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386332961] [2020-12-23 14:17:38,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:38,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 14:17:38,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253039604] [2020-12-23 14:17:38,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 14:17:38,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 14:17:38,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 14:17:38,814 INFO L87 Difference]: Start difference. First operand 279 states and 334 transitions. Second operand 9 states. [2020-12-23 14:17:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:40,301 INFO L93 Difference]: Finished difference Result 665 states and 793 transitions. [2020-12-23 14:17:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 14:17:40,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2020-12-23 14:17:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:40,305 INFO L225 Difference]: With dead ends: 665 [2020-12-23 14:17:40,306 INFO L226 Difference]: Without dead ends: 465 [2020-12-23 14:17:40,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-12-23 14:17:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-12-23 14:17:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 305. [2020-12-23 14:17:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-12-23 14:17:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2020-12-23 14:17:40,329 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 88 [2020-12-23 14:17:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:40,330 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2020-12-23 14:17:40,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 14:17:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2020-12-23 14:17:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 14:17:40,331 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:40,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:40,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 14:17:40,545 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:40,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash -248757824, now seen corresponding path program 1 times [2020-12-23 14:17:40,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:40,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364531206] [2020-12-23 14:17:40,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:40,680 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:40,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397318300] [2020-12-23 14:17:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:42,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:17:42,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:42,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364531206] [2020-12-23 14:17:42,217 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:42,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397318300] [2020-12-23 14:17:42,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:42,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:17:42,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85149849] [2020-12-23 14:17:42,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:17:42,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:17:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:17:42,219 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand 4 states. [2020-12-23 14:17:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:42,316 INFO L93 Difference]: Finished difference Result 508 states and 604 transitions. [2020-12-23 14:17:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:17:42,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 14:17:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:42,319 INFO L225 Difference]: With dead ends: 508 [2020-12-23 14:17:42,319 INFO L226 Difference]: Without dead ends: 297 [2020-12-23 14:17:42,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-12-23 14:17:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2020-12-23 14:17:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-12-23 14:17:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 342 transitions. [2020-12-23 14:17:42,336 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 342 transitions. Word has length 88 [2020-12-23 14:17:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:42,337 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 342 transitions. [2020-12-23 14:17:42,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:17:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 342 transitions. [2020-12-23 14:17:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 14:17:42,338 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:42,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:42,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:42,553 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1179597530, now seen corresponding path program 1 times [2020-12-23 14:17:42,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:42,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989958789] [2020-12-23 14:17:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:42,688 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:42,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400045735] [2020-12-23 14:17:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:44,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 14:17:44,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:17:44,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989958789] [2020-12-23 14:17:44,299 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:17:44,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400045735] [2020-12-23 14:17:44,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:17:44,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 14:17:44,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937267734] [2020-12-23 14:17:44,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 14:17:44,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:17:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 14:17:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:17:44,301 INFO L87 Difference]: Start difference. First operand 289 states and 342 transitions. Second operand 5 states. [2020-12-23 14:17:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:17:49,701 INFO L93 Difference]: Finished difference Result 652 states and 763 transitions. [2020-12-23 14:17:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 14:17:49,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-12-23 14:17:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:17:49,705 INFO L225 Difference]: With dead ends: 652 [2020-12-23 14:17:49,705 INFO L226 Difference]: Without dead ends: 411 [2020-12-23 14:17:49,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 14:17:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-12-23 14:17:49,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 293. [2020-12-23 14:17:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-12-23 14:17:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 344 transitions. [2020-12-23 14:17:49,723 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 344 transitions. Word has length 90 [2020-12-23 14:17:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:17:49,723 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 344 transitions. [2020-12-23 14:17:49,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 14:17:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 344 transitions. [2020-12-23 14:17:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 14:17:49,724 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:17:49,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:17:49,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:49,940 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:17:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:17:49,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1660677788, now seen corresponding path program 1 times [2020-12-23 14:17:49,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:17:49,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543451157] [2020-12-23 14:17:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:17:50,055 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:17:50,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765005516] [2020-12-23 14:17:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:17:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:17:53,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 108 conjunts are in the unsatisfiable core [2020-12-23 14:17:53,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:17:53,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 14:17:53,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:53,310 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,310 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-12-23 14:17:53,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:17:53,574 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-12-23 14:17:53,576 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:53,612 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2020-12-23 14:17:53,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 14:17:53,691 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-12-23 14:17:53,694 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:53,715 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:17:53,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2020-12-23 14:17:54,000 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-23 14:17:54,001 INFO L348 Elim1Store]: treesize reduction 13, result has 83.5 percent of original size [2020-12-23 14:17:54,002 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:17:54,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 14:17:54,015 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:54,105 INFO L625 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2020-12-23 14:17:54,107 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:17:54,108 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2020-12-23 14:17:54,231 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 14:17:54,236 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:54,286 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:54,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:54,293 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:44 [2020-12-23 14:17:58,385 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2020-12-23 14:17:58,538 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:58,539 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:17:58,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:58,638 INFO L625 ElimStorePlain]: treesize reduction 8, result has 84.6 percent of original size [2020-12-23 14:17:58,649 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:58,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:50, output treesize:44 [2020-12-23 14:17:59,128 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:59,128 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2020-12-23 14:17:59,131 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:59,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:59,185 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:59,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:36 [2020-12-23 14:17:59,369 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-12-23 14:17:59,371 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:17:59,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:17:59,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-23 14:17:59,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2020-12-23 14:18:00,116 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2020-12-23 14:18:00,130 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2020-12-23 14:18:00,136 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 14:18:00,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 14:18:00,142 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 14:18:00,142 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:1 [2020-12-23 14:18:00,270 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:18:00,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543451157] [2020-12-23 14:18:00,271 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 14:18:00,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765005516] [2020-12-23 14:18:00,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:18:00,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-23 14:18:00,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920401511] [2020-12-23 14:18:00,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 14:18:00,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:18:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 14:18:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=224, Unknown=1, NotChecked=0, Total=272 [2020-12-23 14:18:00,273 INFO L87 Difference]: Start difference. First operand 293 states and 344 transitions. Second operand 17 states. [2020-12-23 14:18:18,108 WARN L197 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2020-12-23 14:18:18,621 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-12-23 14:18:18,886 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2020-12-23 14:18:19,164 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-12-23 14:18:21,518 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-23 14:18:22,004 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-23 14:18:24,193 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-12-23 14:18:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:18:26,224 INFO L93 Difference]: Finished difference Result 586 states and 690 transitions. [2020-12-23 14:18:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 14:18:26,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2020-12-23 14:18:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:18:26,229 INFO L225 Difference]: With dead ends: 586 [2020-12-23 14:18:26,229 INFO L226 Difference]: Without dead ends: 365 [2020-12-23 14:18:26,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=144, Invalid=455, Unknown=1, NotChecked=0, Total=600 [2020-12-23 14:18:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-12-23 14:18:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 330. [2020-12-23 14:18:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-12-23 14:18:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 388 transitions. [2020-12-23 14:18:26,257 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 388 transitions. Word has length 90 [2020-12-23 14:18:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:18:26,257 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 388 transitions. [2020-12-23 14:18:26,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 14:18:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 388 transitions. [2020-12-23 14:18:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 14:18:26,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:18:26,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:18:26,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 14:18:26,473 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_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.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:18:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:18:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash 913664384, now seen corresponding path program 1 times [2020-12-23 14:18:26,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:18:26,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99336812] [2020-12-23 14:18:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:18:26,608 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 14:18:26,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605314396] [2020-12-23 14:18:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true