/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_test4-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:30:52,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:30:52,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:30:52,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:30:52,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:30:52,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:30:52,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:30:52,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:30:52,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:30:52,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:30:52,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:30:52,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:30:52,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:30:52,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:30:52,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:30:52,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:30:52,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:30:52,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:30:52,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:30:52,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:30:52,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:30:52,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:30:52,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:30:52,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:30:52,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:30:52,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:30:52,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:30:52,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:30:52,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:30:52,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:30:52,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:30:52,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:30:52,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:30:52,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:30:52,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:30:52,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:30:52,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:30:52,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:30:52,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:30:52,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:30:52,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:30:52,885 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:30:52,936 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:30:52,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:30:52,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:30:52,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:30:52,941 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:30:52,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:30:52,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:30:52,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:30:52,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:30:52,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:30:52,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:30:52,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:30:52,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:30:52,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:30:52,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:30:52,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:30:52,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:30:52,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:30:52,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:30:52,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:30:52,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:30:52,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:30:52,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:30:52,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:30:52,946 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:30:52,946 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:30:53,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:30:53,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:30:53,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:30:53,331 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:30:53,331 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:30:53,332 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_test4-3.i [2021-01-07 04:30:53,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/574fd990c/338ca9de36f24ae297b43d08fe7279f4/FLAG15eb11128 [2021-01-07 04:30:54,095 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:30:54,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2021-01-07 04:30:54,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/574fd990c/338ca9de36f24ae297b43d08fe7279f4/FLAG15eb11128 [2021-01-07 04:30:54,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/574fd990c/338ca9de36f24ae297b43d08fe7279f4 [2021-01-07 04:30:54,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:30:54,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:30:54,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:54,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:30:54,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:30:54,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:54" (1/1) ... [2021-01-07 04:30:54,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b70d0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:54, skipping insertion in model container [2021-01-07 04:30:54,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:54" (1/1) ... [2021-01-07 04:30:54,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:30:54,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:30:54,846 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_test4-3.i[33021,33034] 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~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],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~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],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~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],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~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],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~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],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~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~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[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem280,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem280,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem285,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem285,],offset],IdentifierExpression[#t~mem287,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem291,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem291,],offset],IdentifierExpression[#t~mem293,]]]]] 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~mem305,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem305,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem308,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem308,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem321,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem321,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem326,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem326,],offset],IdentifierExpression[#t~mem328,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem332,],offset],IdentifierExpression[#t~mem334,]]]]] 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~mem346,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem346,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem349,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem349,],offset]]]] [2021-01-07 04:30:55,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:55,064 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:30:55,099 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_test4-3.i[33021,33034] 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~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],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~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],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~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],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~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],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~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],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~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],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]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~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[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem293,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem293,],offset],IdentifierExpression[#t~mem295,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem299,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem299,],offset],IdentifierExpression[#t~mem301,]]]]] 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~mem313,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem313,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem316,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem316,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem329,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem329,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem334,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem334,],offset],IdentifierExpression[#t~mem336,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem340,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem340,],offset],IdentifierExpression[#t~mem342,]]]]] 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~mem354,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem354,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem357,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem357,],offset]]]] [2021-01-07 04:30:55,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:55,448 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:30:55,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55 WrapperNode [2021-01-07 04:30:55,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:55,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:55,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:30:55,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:30:55,461 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:30:55" (1/1) ... [2021-01-07 04:30:55,541 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:30:55" (1/1) ... [2021-01-07 04:30:55,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:55,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:30:55,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:30:55,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:30:55,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (1/1) ... [2021-01-07 04:30:55,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:30:55,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:30:55,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:30:55,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:30:55,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (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:30:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:30:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:30:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:30:55,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:30:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:30:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:30:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:30:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:30:55,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:30:55,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:30:58,332 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:30:58,333 INFO L299 CfgBuilder]: Removed 115 assume(true) statements. [2021-01-07 04:30:58,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:58 BoogieIcfgContainer [2021-01-07 04:30:58,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:30:58,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:30:58,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:30:58,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:30:58,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:30:54" (1/3) ... [2021-01-07 04:30:58,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4223d57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:58, skipping insertion in model container [2021-01-07 04:30:58,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:55" (2/3) ... [2021-01-07 04:30:58,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4223d57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:58, skipping insertion in model container [2021-01-07 04:30:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:58" (3/3) ... [2021-01-07 04:30:58,343 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2021-01-07 04:30:58,350 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:30:58,355 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2021-01-07 04:30:58,374 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-07 04:30:58,402 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:30:58,403 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:30:58,403 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:30:58,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:30:58,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:30:58,403 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:30:58,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:30:58,404 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:30:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2021-01-07 04:30:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:30:58,434 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:58,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:58,436 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2021-01-07 04:30:58,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:58,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399828000] [2021-01-07 04:30:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:58,619 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:30:58,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399828000] [2021-01-07 04:30:58,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:58,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:30:58,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005039060] [2021-01-07 04:30:58,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:30:58,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:30:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:30:58,645 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 2 states. [2021-01-07 04:30:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:58,705 INFO L93 Difference]: Finished difference Result 540 states and 896 transitions. [2021-01-07 04:30:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:30:58,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:30:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:58,723 INFO L225 Difference]: With dead ends: 540 [2021-01-07 04:30:58,723 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 04:30:58,728 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:30:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 04:30:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-01-07 04:30:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-07 04:30:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2021-01-07 04:30:58,796 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2021-01-07 04:30:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:58,797 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2021-01-07 04:30:58,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:30:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2021-01-07 04:30:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:30:58,798 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:58,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:58,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:30:58,799 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2021-01-07 04:30:58,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:58,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486661953] [2021-01-07 04:30:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:58,910 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:30:58,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486661953] [2021-01-07 04:30:58,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:58,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:58,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354567185] [2021-01-07 04:30:58,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:58,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:58,916 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2021-01-07 04:30:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:58,992 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2021-01-07 04:30:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:58,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 04:30:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:58,998 INFO L225 Difference]: With dead ends: 432 [2021-01-07 04:30:58,998 INFO L226 Difference]: Without dead ends: 387 [2021-01-07 04:30:59,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-07 04:30:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2021-01-07 04:30:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 04:30:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2021-01-07 04:30:59,049 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2021-01-07 04:30:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:59,050 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2021-01-07 04:30:59,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2021-01-07 04:30:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:59,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:59,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:59,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:30:59,061 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2021-01-07 04:30:59,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:59,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069448965] [2021-01-07 04:30:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:59,096 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:59,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376497795] [2021-01-07 04:30:59,097 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:30:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:59,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:59,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:59,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069448965] [2021-01-07 04:30:59,679 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:59,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376497795] [2021-01-07 04:30:59,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:59,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:59,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157096817] [2021-01-07 04:30:59,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:59,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:59,690 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2021-01-07 04:30:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:59,791 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-01-07 04:30:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:59,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:30:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:59,793 INFO L225 Difference]: With dead ends: 454 [2021-01-07 04:30:59,793 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 04:30:59,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:30:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 04:30:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2021-01-07 04:30:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 04:30:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2021-01-07 04:30:59,823 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2021-01-07 04:30:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:59,823 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2021-01-07 04:30:59,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2021-01-07 04:30:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:59,828 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:59,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:31:00,046 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2021-01-07 04:31:00,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:00,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424533198] [2021-01-07 04:31:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:00,093 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:00,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854312214] [2021-01-07 04:31:00,094 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:31:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:31:00,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:31:00,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424533198] [2021-01-07 04:31:00,497 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:00,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854312214] [2021-01-07 04:31:00,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:00,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:31:00,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059540806] [2021-01-07 04:31:00,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:31:00,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:00,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:31:00,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:31:00,500 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2021-01-07 04:31:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:00,600 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2021-01-07 04:31:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:31:00,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:31:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:00,602 INFO L225 Difference]: With dead ends: 494 [2021-01-07 04:31:00,603 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 04:31:00,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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:31:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 04:31:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-01-07 04:31:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2021-01-07 04:31:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2021-01-07 04:31:00,611 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2021-01-07 04:31:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:00,612 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2021-01-07 04:31:00,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:31:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2021-01-07 04:31:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:31:00,614 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:00,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:31:00,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:00,830 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2021-01-07 04:31:00,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:00,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415466821] [2021-01-07 04:31:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:00,854 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:00,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669541531] [2021-01-07 04:31:00,854 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:31:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:01,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:31:01,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:31:01,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415466821] [2021-01-07 04:31:01,297 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:01,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669541531] [2021-01-07 04:31:01,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:01,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:31:01,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975400576] [2021-01-07 04:31:01,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:31:01,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:31:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:01,299 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2021-01-07 04:31:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:01,404 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2021-01-07 04:31:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:31:01,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:31:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:01,406 INFO L225 Difference]: With dead ends: 505 [2021-01-07 04:31:01,406 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 04:31:01,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:31:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 04:31:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2021-01-07 04:31:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-07 04:31:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2021-01-07 04:31:01,414 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2021-01-07 04:31:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:01,415 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2021-01-07 04:31:01,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:31:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2021-01-07 04:31:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:31:01,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:01,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:31:01,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:01,631 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2021-01-07 04:31:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:01,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189585027] [2021-01-07 04:31:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:01,656 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:01,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754013357] [2021-01-07 04:31:01,657 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:31:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:01,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:31:01,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:31:02,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189585027] [2021-01-07 04:31:02,043 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:02,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754013357] [2021-01-07 04:31:02,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:02,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:31:02,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101116318] [2021-01-07 04:31:02,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:31:02,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:31:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:02,046 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2021-01-07 04:31:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:02,141 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2021-01-07 04:31:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:31:02,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:31:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:02,144 INFO L225 Difference]: With dead ends: 566 [2021-01-07 04:31:02,144 INFO L226 Difference]: Without dead ends: 325 [2021-01-07 04:31:02,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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:31:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-07 04:31:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2021-01-07 04:31:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 04:31:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2021-01-07 04:31:02,153 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2021-01-07 04:31:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:02,155 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2021-01-07 04:31:02,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:31:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2021-01-07 04:31:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:31:02,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:02,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:02,368 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:02,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:02,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2021-01-07 04:31:02,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:02,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554970327] [2021-01-07 04:31:02,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:02,408 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:02,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477506680] [2021-01-07 04:31:02,412 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:31:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:02,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:31:02,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:31:02,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554970327] [2021-01-07 04:31:02,867 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:02,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477506680] [2021-01-07 04:31:02,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:31:02,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:31:02,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550342866] [2021-01-07 04:31:02,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:31:02,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:02,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:31:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:02,870 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2021-01-07 04:31:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:02,910 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2021-01-07 04:31:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:31:02,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:31:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:02,914 INFO L225 Difference]: With dead ends: 638 [2021-01-07 04:31:02,914 INFO L226 Difference]: Without dead ends: 593 [2021-01-07 04:31:02,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-01-07 04:31:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2021-01-07 04:31:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-07 04:31:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2021-01-07 04:31:02,932 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2021-01-07 04:31:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:02,932 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2021-01-07 04:31:02,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:31:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2021-01-07 04:31:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-07 04:31:02,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:02,935 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:31:03,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:31:03,148 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2021-01-07 04:31:03,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:03,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620821079] [2021-01-07 04:31:03,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:03,173 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:03,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573834952] [2021-01-07 04:31:03,174 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 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:31:03,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 04:31:03,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:31:03,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:31:03,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-07 04:31:03,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620821079] [2021-01-07 04:31:03,801 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:03,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573834952] [2021-01-07 04:31:03,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:03,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:31:03,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887781000] [2021-01-07 04:31:03,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:31:03,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:31:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:03,804 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2021-01-07 04:31:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:04,567 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2021-01-07 04:31:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:31:04,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2021-01-07 04:31:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:04,570 INFO L225 Difference]: With dead ends: 677 [2021-01-07 04:31:04,570 INFO L226 Difference]: Without dead ends: 410 [2021-01-07 04:31:04,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 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:31:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-01-07 04:31:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-01-07 04:31:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2021-01-07 04:31:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2021-01-07 04:31:04,584 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2021-01-07 04:31:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:04,584 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2021-01-07 04:31:04,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:31:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2021-01-07 04:31:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-07 04:31:04,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:04,587 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:31:04,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:04,802 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2021-01-07 04:31:04,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:04,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085876538] [2021-01-07 04:31:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:04,827 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:04,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236633609] [2021-01-07 04:31:04,827 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:31:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:05,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:31:05,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 04:31:05,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085876538] [2021-01-07 04:31:05,371 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:05,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236633609] [2021-01-07 04:31:05,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:05,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:31:05,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972294951] [2021-01-07 04:31:05,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:31:05,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:31:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:31:05,373 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2021-01-07 04:31:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:05,456 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2021-01-07 04:31:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:31:05,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2021-01-07 04:31:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:05,460 INFO L225 Difference]: With dead ends: 776 [2021-01-07 04:31:05,460 INFO L226 Difference]: Without dead ends: 418 [2021-01-07 04:31:05,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 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:31:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-07 04:31:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-01-07 04:31:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-07 04:31:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2021-01-07 04:31:05,477 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2021-01-07 04:31:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:05,477 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2021-01-07 04:31:05,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:31:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2021-01-07 04:31:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-07 04:31:05,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:05,481 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-07 04:31:05,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:05,695 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2021-01-07 04:31:05,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:05,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625577788] [2021-01-07 04:31:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:05,722 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:05,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139788861] [2021-01-07 04:31:05,723 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:31:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:06,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:31:06,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 04:31:06,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625577788] [2021-01-07 04:31:06,372 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:06,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139788861] [2021-01-07 04:31:06,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:31:06,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:31:06,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104054909] [2021-01-07 04:31:06,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:31:06,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:31:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:06,375 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2021-01-07 04:31:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:06,454 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2021-01-07 04:31:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:31:06,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-07 04:31:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:06,457 INFO L225 Difference]: With dead ends: 791 [2021-01-07 04:31:06,457 INFO L226 Difference]: Without dead ends: 426 [2021-01-07 04:31:06,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:31:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-01-07 04:31:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-01-07 04:31:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-07 04:31:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2021-01-07 04:31:06,473 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2021-01-07 04:31:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:06,473 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2021-01-07 04:31:06,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:31:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2021-01-07 04:31:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-07 04:31:06,476 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:06,476 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:31:06,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:31:06,690 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2021-01-07 04:31:06,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:06,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727604280] [2021-01-07 04:31:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:06,734 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:06,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30361403] [2021-01-07 04:31:06,734 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 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:31:07,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:31:07,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:31:07,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:31:07,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 04:31:07,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727604280] [2021-01-07 04:31:07,396 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:07,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30361403] [2021-01-07 04:31:07,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:31:07,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:31:07,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379313729] [2021-01-07 04:31:07,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:31:07,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:31:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:31:07,398 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2021-01-07 04:31:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:07,481 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2021-01-07 04:31:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:31:07,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-07 04:31:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:07,484 INFO L225 Difference]: With dead ends: 806 [2021-01-07 04:31:07,484 INFO L226 Difference]: Without dead ends: 434 [2021-01-07 04:31:07,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 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:31:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-01-07 04:31:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-01-07 04:31:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-07 04:31:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2021-01-07 04:31:07,500 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2021-01-07 04:31:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:07,500 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2021-01-07 04:31:07,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:31:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2021-01-07 04:31:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-07 04:31:07,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:07,504 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:31:07,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:07,719 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2021-01-07 04:31:07,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:07,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260052109] [2021-01-07 04:31:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:07,760 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:07,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207165065] [2021-01-07 04:31:07,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2021-01-07 04:31:08,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:31:08,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:31:08,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:31:08,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-07 04:31:08,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260052109] [2021-01-07 04:31:08,397 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:08,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207165065] [2021-01-07 04:31:08,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:31:08,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:31:08,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276287175] [2021-01-07 04:31:08,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:31:08,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:31:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:31:08,399 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2021-01-07 04:31:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:08,509 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2021-01-07 04:31:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:31:08,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-07 04:31:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:08,514 INFO L225 Difference]: With dead ends: 804 [2021-01-07 04:31:08,514 INFO L226 Difference]: Without dead ends: 432 [2021-01-07 04:31:08,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 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:31:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-07 04:31:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-01-07 04:31:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-07 04:31:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2021-01-07 04:31:08,531 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2021-01-07 04:31:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:08,532 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2021-01-07 04:31:08,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:31:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2021-01-07 04:31:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-01-07 04:31:08,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:08,535 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-07 04:31:08,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:08,750 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2021-01-07 04:31:08,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:08,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905966996] [2021-01-07 04:31:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:08,772 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:08,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193912044] [2021-01-07 04:31:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:31:09,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:31:09,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-07 04:31:09,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905966996] [2021-01-07 04:31:09,423 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:09,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193912044] [2021-01-07 04:31:09,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:31:09,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:31:09,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452190774] [2021-01-07 04:31:09,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:31:09,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:09,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:31:09,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:31:09,426 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2021-01-07 04:31:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:09,527 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2021-01-07 04:31:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:31:09,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2021-01-07 04:31:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:09,530 INFO L225 Difference]: With dead ends: 819 [2021-01-07 04:31:09,530 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:31:09,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:31:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:31:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-01-07 04:31:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2021-01-07 04:31:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2021-01-07 04:31:09,549 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2021-01-07 04:31:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:09,549 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2021-01-07 04:31:09,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:31:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2021-01-07 04:31:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 04:31:09,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:09,553 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-07 04:31:09,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:31:09,767 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2021-01-07 04:31:09,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:09,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554202733] [2021-01-07 04:31:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:09,808 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:09,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073117095] [2021-01-07 04:31:09,809 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:31:10,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:31:10,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:31:10,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:31:10,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:31:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-07 04:31:10,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554202733] [2021-01-07 04:31:10,537 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:31:10,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073117095] [2021-01-07 04:31:10,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:31:10,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:31:10,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513717738] [2021-01-07 04:31:10,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:31:10,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:31:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:31:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:31:10,539 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2021-01-07 04:31:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:31:10,650 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2021-01-07 04:31:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:31:10,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2021-01-07 04:31:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:31:10,653 INFO L225 Difference]: With dead ends: 834 [2021-01-07 04:31:10,653 INFO L226 Difference]: Without dead ends: 448 [2021-01-07 04:31:10,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:31:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-01-07 04:31:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-01-07 04:31:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2021-01-07 04:31:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2021-01-07 04:31:10,671 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2021-01-07 04:31:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:31:10,672 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2021-01-07 04:31:10,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:31:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2021-01-07 04:31:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:31:10,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:31:10,674 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-07 04:31:10,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:31:10,887 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:31:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:31:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2021-01-07 04:31:10,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:31:10,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603521905] [2021-01-07 04:31:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:31:10,909 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:31:10,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068970903] [2021-01-07 04:31:10,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true