/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/uthash-2.0.2/uthash_OAT_test6-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:34:13,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:34:13,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:34:13,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:34:13,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:34:13,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:34:13,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:34:13,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:34:13,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:34:13,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:34:13,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:34:13,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:34:13,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:34:13,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:34:13,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:34:13,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:34:13,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:34:13,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:34:13,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:34:13,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:34:13,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:34:13,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:34:13,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:34:13,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:34:13,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:34:13,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:34:13,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:34:13,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:34:13,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:34:13,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:34:13,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:34:13,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:34:13,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:34:13,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:34:13,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:34:13,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:34:13,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:34:13,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:34:13,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:34:13,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:34:13,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:34:13,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 04:34:13,911 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:34:13,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:34:13,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:34:13,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:34:13,913 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:34:13,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:34:13,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:34:13,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:34:13,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:34:13,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:34:13,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:34:13,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:34:13,915 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:34:13,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:34:13,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:34:13,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:34:13,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:34:13,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:34:13,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:34:13,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:34:13,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:34:13,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:34:13,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:34:13,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:34:13,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:34:13,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 04:34:14,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:34:14,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:34:14,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:34:14,365 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:34:14,366 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:34:14,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-01-07 04:34:14,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8844a68a/28c85f95cad64c98ad4c872394e5fed8/FLAGab1053040 [2021-01-07 04:34:15,376 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:34:15,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2021-01-07 04:34:15,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8844a68a/28c85f95cad64c98ad4c872394e5fed8/FLAGab1053040 [2021-01-07 04:34:15,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a8844a68a/28c85f95cad64c98ad4c872394e5fed8 [2021-01-07 04:34:15,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:34:15,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:34:15,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:34:15,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:34:15,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:34:15,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:34:15" (1/1) ... [2021-01-07 04:34:15,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da4a4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:15, skipping insertion in model container [2021-01-07 04:34:15,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:34:15" (1/1) ... [2021-01-07 04:34:15,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:34:15,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:34:16,205 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/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~alt_malloc_sizes~0,GLOBAL],[IdentifierExpression[#t~post33,]]] [2021-01-07 04:34:16,224 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/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem70,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem71,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem71,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem73,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem73,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem74,],base],StructAccessExpression[IdentifierExpression[#t~mem74,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem101,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem101,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem122,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem122,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem148,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem158,],base],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem159,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem159,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem224,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem224,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem229,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem229,],offset],IdentifierExpression[#t~mem231,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem235,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem235,],offset],IdentifierExpression[#t~mem237,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem249,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem249,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] [2021-01-07 04:34:16,409 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/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:34:16,413 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/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem277,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem277,],offset],IdentifierExpression[#t~mem279,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem283,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem283,],offset],IdentifierExpression[#t~mem285,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem297,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem297,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem300,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem300,],offset]]]] [2021-01-07 04:34:16,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:34:16,473 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:34:16,547 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/uthash-2.0.2/uthash_OAT_test6-2.i[44118,44131] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post33,]]]]] [2021-01-07 04:34:16,550 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/uthash-2.0.2/uthash_OAT_test6-2.i[44660,44673] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem77,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem77,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem79,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem79,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem82,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem82,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem94,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem94,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem95,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem107,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem157,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem157,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem236,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem236,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem241,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem241,],offset],IdentifierExpression[#t~mem243,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem247,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem247,],offset],IdentifierExpression[#t~mem249,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem261,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem261,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] [2021-01-07 04:34:16,623 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/uthash-2.0.2/uthash_OAT_test6-2.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:34:16,624 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/uthash-2.0.2/uthash_OAT_test6-2.i[56368,56381] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem284,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem284,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem289,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem289,],offset],IdentifierExpression[#t~mem291,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem295,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem295,],offset],IdentifierExpression[#t~mem297,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem309,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem309,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem312,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem312,],offset]]]] [2021-01-07 04:34:16,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:34:16,949 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:34:16,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16 WrapperNode [2021-01-07 04:34:16,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:34:16,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:34:16,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:34:16,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:34:16,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:34:17,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:34:17,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:34:17,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:34:17,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... [2021-01-07 04:34:17,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:34:17,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:34:17,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:34:17,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:34:17,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:34:17,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:34:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:34:17,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:34:17,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:34:17,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:34:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:34:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:34:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:34:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:34:17,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:34:17,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:34:19,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:34:19,800 INFO L299 CfgBuilder]: Removed 124 assume(true) statements. [2021-01-07 04:34:19,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:34:19 BoogieIcfgContainer [2021-01-07 04:34:19,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:34:19,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:34:19,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:34:19,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:34:19,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:34:15" (1/3) ... [2021-01-07 04:34:19,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b27fc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:34:19, skipping insertion in model container [2021-01-07 04:34:19,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:34:16" (2/3) ... [2021-01-07 04:34:19,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b27fc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:34:19, skipping insertion in model container [2021-01-07 04:34:19,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:34:19" (3/3) ... [2021-01-07 04:34:19,813 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2021-01-07 04:34:19,820 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:34:19,827 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-01-07 04:34:19,851 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-01-07 04:34:19,885 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:34:19,885 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:34:19,886 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:34:19,886 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:34:19,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:34:19,886 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:34:19,886 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:34:19,886 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:34:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2021-01-07 04:34:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:34:19,922 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:19,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:19,924 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]=== [2021-01-07 04:34:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1030621672, now seen corresponding path program 1 times [2021-01-07 04:34:19,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:19,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726423107] [2021-01-07 04:34:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:20,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726423107] [2021-01-07 04:34:20,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:20,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:34:20,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261729990] [2021-01-07 04:34:20,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:34:20,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:34:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:34:20,224 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 2 states. [2021-01-07 04:34:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:20,323 INFO L93 Difference]: Finished difference Result 544 states and 861 transitions. [2021-01-07 04:34:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:34:20,325 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:34:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:20,358 INFO L225 Difference]: With dead ends: 544 [2021-01-07 04:34:20,359 INFO L226 Difference]: Without dead ends: 266 [2021-01-07 04:34:20,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:34:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-07 04:34:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-01-07 04:34:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-07 04:34:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 335 transitions. [2021-01-07 04:34:20,482 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 335 transitions. Word has length 8 [2021-01-07 04:34:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:20,483 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 335 transitions. [2021-01-07 04:34:20,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:34:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 335 transitions. [2021-01-07 04:34:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 04:34:20,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:20,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:20,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:34:20,486 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]=== [2021-01-07 04:34:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1260005844, now seen corresponding path program 1 times [2021-01-07 04:34:20,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:20,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865601028] [2021-01-07 04:34:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:20,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865601028] [2021-01-07 04:34:20,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:20,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:34:20,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218780543] [2021-01-07 04:34:20,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:34:20,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:34:20,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:34:20,649 INFO L87 Difference]: Start difference. First operand 266 states and 335 transitions. Second operand 4 states. [2021-01-07 04:34:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:21,370 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2021-01-07 04:34:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:34:21,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 04:34:21,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:21,376 INFO L225 Difference]: With dead ends: 589 [2021-01-07 04:34:21,377 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:34:21,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:34:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 268. [2021-01-07 04:34:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-07 04:34:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2021-01-07 04:34:21,419 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 10 [2021-01-07 04:34:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:21,420 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2021-01-07 04:34:21,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:34:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2021-01-07 04:34:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:34:21,422 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:21,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:21,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:34:21,423 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]=== [2021-01-07 04:34:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -602340381, now seen corresponding path program 1 times [2021-01-07 04:34:21,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:21,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442215652] [2021-01-07 04:34:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:21,491 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:21,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447161431] [2021-01-07 04:34:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:34:21,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:21,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442215652] [2021-01-07 04:34:21,891 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:21,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447161431] [2021-01-07 04:34:21,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:21,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:34:21,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059314127] [2021-01-07 04:34:21,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:34:21,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:34:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:34:21,904 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2021-01-07 04:34:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:22,023 INFO L93 Difference]: Finished difference Result 553 states and 701 transitions. [2021-01-07 04:34:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:34:22,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:34:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:22,025 INFO L225 Difference]: With dead ends: 553 [2021-01-07 04:34:22,025 INFO L226 Difference]: Without dead ends: 289 [2021-01-07 04:34:22,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:34:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-07 04:34:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2021-01-07 04:34:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2021-01-07 04:34:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 357 transitions. [2021-01-07 04:34:22,041 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 357 transitions. Word has length 44 [2021-01-07 04:34:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:22,042 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 357 transitions. [2021-01-07 04:34:22,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:34:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 357 transitions. [2021-01-07 04:34:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:34:22,046 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:22,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:22,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:34:22,261 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]=== [2021-01-07 04:34:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -821195099, now seen corresponding path program 1 times [2021-01-07 04:34:22,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:22,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989506546] [2021-01-07 04:34:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:22,285 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:22,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669345364] [2021-01-07 04:34:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:22,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:34:22,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:22,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989506546] [2021-01-07 04:34:22,662 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:22,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669345364] [2021-01-07 04:34:22,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:22,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:34:22,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253679195] [2021-01-07 04:34:22,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:34:22,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:34:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:34:22,665 INFO L87 Difference]: Start difference. First operand 288 states and 357 transitions. Second operand 4 states. [2021-01-07 04:34:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:22,771 INFO L93 Difference]: Finished difference Result 565 states and 703 transitions. [2021-01-07 04:34:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:34:22,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:34:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:22,773 INFO L225 Difference]: With dead ends: 565 [2021-01-07 04:34:22,773 INFO L226 Difference]: Without dead ends: 281 [2021-01-07 04:34:22,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-07 04:34:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2021-01-07 04:34:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2021-01-07 04:34:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 336 transitions. [2021-01-07 04:34:22,783 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 336 transitions. Word has length 44 [2021-01-07 04:34:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:22,783 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 336 transitions. [2021-01-07 04:34:22,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:34:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 336 transitions. [2021-01-07 04:34:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:34:22,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:22,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:23,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:23,001 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]=== [2021-01-07 04:34:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1704043945, now seen corresponding path program 1 times [2021-01-07 04:34:23,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:23,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800941622] [2021-01-07 04:34:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:23,056 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:23,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129307600] [2021-01-07 04:34:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:23,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 04:34:23,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:23,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800941622] [2021-01-07 04:34:23,410 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:23,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129307600] [2021-01-07 04:34:23,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:23,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:34:23,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452716934] [2021-01-07 04:34:23,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:34:23,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:23,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:34:23,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:34:23,413 INFO L87 Difference]: Start difference. First operand 274 states and 336 transitions. Second operand 6 states. [2021-01-07 04:34:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:24,333 INFO L93 Difference]: Finished difference Result 486 states and 600 transitions. [2021-01-07 04:34:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:34:24,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-07 04:34:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:24,339 INFO L225 Difference]: With dead ends: 486 [2021-01-07 04:34:24,339 INFO L226 Difference]: Without dead ends: 484 [2021-01-07 04:34:24,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:34:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-07 04:34:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 272. [2021-01-07 04:34:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-07 04:34:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 334 transitions. [2021-01-07 04:34:24,357 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 334 transitions. Word has length 44 [2021-01-07 04:34:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:24,358 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 334 transitions. [2021-01-07 04:34:24,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:34:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 334 transitions. [2021-01-07 04:34:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 04:34:24,369 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:24,369 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] [2021-01-07 04:34:24,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:24,584 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]=== [2021-01-07 04:34:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1088553020, now seen corresponding path program 1 times [2021-01-07 04:34:24,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:24,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575172227] [2021-01-07 04:34:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:24,619 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:24,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58174654] [2021-01-07 04:34:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:24,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:34:24,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:24,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575172227] [2021-01-07 04:34:24,967 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:24,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58174654] [2021-01-07 04:34:24,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:24,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:34:24,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930002993] [2021-01-07 04:34:24,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:34:24,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:34:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:24,975 INFO L87 Difference]: Start difference. First operand 272 states and 334 transitions. Second operand 5 states. [2021-01-07 04:34:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:25,151 INFO L93 Difference]: Finished difference Result 1120 states and 1390 transitions. [2021-01-07 04:34:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:34:25,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 04:34:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:25,159 INFO L225 Difference]: With dead ends: 1120 [2021-01-07 04:34:25,159 INFO L226 Difference]: Without dead ends: 852 [2021-01-07 04:34:25,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-01-07 04:34:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 364. [2021-01-07 04:34:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2021-01-07 04:34:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 445 transitions. [2021-01-07 04:34:25,197 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 445 transitions. Word has length 51 [2021-01-07 04:34:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:25,199 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 445 transitions. [2021-01-07 04:34:25,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:34:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 445 transitions. [2021-01-07 04:34:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 04:34:25,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:25,203 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] [2021-01-07 04:34:25,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:25,417 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]=== [2021-01-07 04:34:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1193587178, now seen corresponding path program 1 times [2021-01-07 04:34:25,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:25,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176690378] [2021-01-07 04:34:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:25,440 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:25,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800279008] [2021-01-07 04:34:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:25,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:34:25,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:25,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176690378] [2021-01-07 04:34:25,819 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:25,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800279008] [2021-01-07 04:34:25,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:25,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:34:25,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926298074] [2021-01-07 04:34:25,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:34:25,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:34:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:34:25,822 INFO L87 Difference]: Start difference. First operand 364 states and 445 transitions. Second operand 3 states. [2021-01-07 04:34:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:26,029 INFO L93 Difference]: Finished difference Result 802 states and 981 transitions. [2021-01-07 04:34:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:34:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-07 04:34:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:26,032 INFO L225 Difference]: With dead ends: 802 [2021-01-07 04:34:26,032 INFO L226 Difference]: Without dead ends: 442 [2021-01-07 04:34:26,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:34:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-01-07 04:34:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 385. [2021-01-07 04:34:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:34:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2021-01-07 04:34:26,050 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 54 [2021-01-07 04:34:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:26,051 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2021-01-07 04:34:26,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:34:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2021-01-07 04:34:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 04:34:26,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:26,052 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:26,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:34:26,266 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]=== [2021-01-07 04:34:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash 901612414, now seen corresponding path program 1 times [2021-01-07 04:34:26,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:26,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320006490] [2021-01-07 04:34:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:26,286 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:26,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28410854] [2021-01-07 04:34:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:26,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:34:26,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:26,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320006490] [2021-01-07 04:34:26,639 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:26,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28410854] [2021-01-07 04:34:26,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:26,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:34:26,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468716532] [2021-01-07 04:34:26,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:34:26,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:26,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:34:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:34:26,641 INFO L87 Difference]: Start difference. First operand 385 states and 476 transitions. Second operand 4 states. [2021-01-07 04:34:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:26,802 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:34:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:34:26,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 04:34:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:26,805 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:34:26,805 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:34:26,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:34:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:34:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2021-01-07 04:34:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2021-01-07 04:34:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 475 transitions. [2021-01-07 04:34:26,823 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 475 transitions. Word has length 78 [2021-01-07 04:34:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:26,824 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 475 transitions. [2021-01-07 04:34:26,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:34:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 475 transitions. [2021-01-07 04:34:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 04:34:26,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:26,825 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:27,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:27,028 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]=== [2021-01-07 04:34:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash -611683268, now seen corresponding path program 1 times [2021-01-07 04:34:27,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:27,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585727896] [2021-01-07 04:34:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:27,051 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:27,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002971505] [2021-01-07 04:34:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:27,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:34:27,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:27,418 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-01-07 04:34:27,419 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:34:27,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:34:27,423 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:34:27,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-01-07 04:34:27,441 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 15 treesize of output 7 [2021-01-07 04:34:27,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:34:27,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:34:27,445 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:34:27,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 04:34:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:34:27,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585727896] [2021-01-07 04:34:27,457 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:27,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002971505] [2021-01-07 04:34:27,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:27,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:34:27,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588566552] [2021-01-07 04:34:27,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:34:27,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:34:27,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:34:27,460 INFO L87 Difference]: Start difference. First operand 385 states and 475 transitions. Second operand 4 states. [2021-01-07 04:34:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:27,918 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-01-07 04:34:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:34:27,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-07 04:34:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:27,921 INFO L225 Difference]: With dead ends: 535 [2021-01-07 04:34:27,921 INFO L226 Difference]: Without dead ends: 480 [2021-01-07 04:34:27,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-01-07 04:34:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 387. [2021-01-07 04:34:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2021-01-07 04:34:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 477 transitions. [2021-01-07 04:34:27,941 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 477 transitions. Word has length 79 [2021-01-07 04:34:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:27,942 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 477 transitions. [2021-01-07 04:34:27,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:34:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 477 transitions. [2021-01-07 04:34:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 04:34:27,943 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:27,943 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] [2021-01-07 04:34:28,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:28,159 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]=== [2021-01-07 04:34:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1201768388, now seen corresponding path program 1 times [2021-01-07 04:34:28,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:28,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119644186] [2021-01-07 04:34:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:28,180 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:28,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788912047] [2021-01-07 04:34:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:28,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 04:34:28,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:34:28,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119644186] [2021-01-07 04:34:28,616 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:28,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788912047] [2021-01-07 04:34:28,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:34:28,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:34:28,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907544270] [2021-01-07 04:34:28,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:34:28,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:28,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:34:28,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:34:28,618 INFO L87 Difference]: Start difference. First operand 387 states and 477 transitions. Second operand 5 states. [2021-01-07 04:34:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:28,758 INFO L93 Difference]: Finished difference Result 724 states and 901 transitions. [2021-01-07 04:34:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:34:28,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-07 04:34:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:28,761 INFO L225 Difference]: With dead ends: 724 [2021-01-07 04:34:28,762 INFO L226 Difference]: Without dead ends: 389 [2021-01-07 04:34:28,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:34:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-01-07 04:34:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2021-01-07 04:34:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2021-01-07 04:34:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2021-01-07 04:34:28,780 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 81 [2021-01-07 04:34:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:28,781 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2021-01-07 04:34:28,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:34:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2021-01-07 04:34:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 04:34:28,782 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:28,782 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] [2021-01-07 04:34:28,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:34:28,997 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]=== [2021-01-07 04:34:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1914773501, now seen corresponding path program 1 times [2021-01-07 04:34:28,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:28,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207476320] [2021-01-07 04:34:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:29,020 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:29,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218880709] [2021-01-07 04:34:29,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:34:29,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 04:34:29,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:34:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:34:29,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207476320] [2021-01-07 04:34:29,481 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:34:29,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218880709] [2021-01-07 04:34:29,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:34:29,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:34:29,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609351306] [2021-01-07 04:34:29,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:34:29,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:34:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:34:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:34:29,483 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand 6 states. [2021-01-07 04:34:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:34:29,732 INFO L93 Difference]: Finished difference Result 728 states and 905 transitions. [2021-01-07 04:34:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:34:29,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2021-01-07 04:34:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:34:29,736 INFO L225 Difference]: With dead ends: 728 [2021-01-07 04:34:29,736 INFO L226 Difference]: Without dead ends: 391 [2021-01-07 04:34:29,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:34:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-07 04:34:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2021-01-07 04:34:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-07 04:34:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 481 transitions. [2021-01-07 04:34:29,758 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 481 transitions. Word has length 83 [2021-01-07 04:34:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:34:29,758 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 481 transitions. [2021-01-07 04:34:29,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:34:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 481 transitions. [2021-01-07 04:34:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 04:34:29,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:34:29,760 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:34:29,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:34:29,974 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]=== [2021-01-07 04:34:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:34:29,975 INFO L82 PathProgramCache]: Analyzing trace with hash 931638948, now seen corresponding path program 2 times [2021-01-07 04:34:29,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:34:29,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382974993] [2021-01-07 04:34:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:34:29,998 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:34:29,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537598364] [2021-01-07 04:34:29,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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