/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_SFH_test5-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:48:51,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:48:51,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:48:51,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:48:51,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:48:51,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:48:51,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:48:51,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:48:51,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:48:51,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:48:51,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:48:51,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:48:51,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:48:51,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:48:51,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:48:51,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:48:51,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:48:51,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:48:51,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:48:51,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:48:51,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:48:51,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:48:51,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:48:51,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:48:51,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:48:51,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:48:51,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:48:51,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:48:51,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:48:51,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:48:51,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:48:51,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:48:51,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:48:51,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:48:51,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:48:51,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:48:51,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:48:51,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:48:51,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:48:51,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:48:51,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:48:51,227 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:48:51,285 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:48:51,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:48:51,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:48:51,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:48:51,291 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:48:51,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:48:51,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:48:51,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:48:51,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:48:51,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:48:51,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:48:51,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:48:51,294 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:48:51,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:48:51,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:48:51,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:48:51,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:48:51,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:48:51,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:48:51,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:48:51,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:48:51,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:48:51,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:48:51,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:48:51,296 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:48:51,297 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:48:51,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:48:51,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:48:51,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:48:51,760 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:48:51,761 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:48:51,762 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_SFH_test5-3.i [2021-01-07 04:48:51,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5759775ca/2a70b0ad192b4cb58afdc228922591df/FLAGd40fd500c [2021-01-07 04:48:52,604 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:48:52,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2021-01-07 04:48:52,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5759775ca/2a70b0ad192b4cb58afdc228922591df/FLAGd40fd500c [2021-01-07 04:48:52,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5759775ca/2a70b0ad192b4cb58afdc228922591df [2021-01-07 04:48:52,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:48:52,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:48:52,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:48:52,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:48:52,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:48:52,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:48:52" (1/1) ... [2021-01-07 04:48:52,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:52, skipping insertion in model container [2021-01-07 04:48:52,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:48:52" (1/1) ... [2021-01-07 04:48:52,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:48:52,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:48:53,481 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_SFH_test5-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[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:48:53,659 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_SFH_test5-3.i[49681,49694] 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~mem322,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem322,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem327,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem327,],offset],IdentifierExpression[#t~mem329,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem333,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem333,],offset],IdentifierExpression[#t~mem335,]]]]] 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~mem347,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem347,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem350,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem350,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem363,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem363,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem368,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem368,],offset],IdentifierExpression[#t~mem370,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem374,],offset],IdentifierExpression[#t~mem376,]]]]] 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~mem388,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem388,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem391,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem391,],offset]]]] [2021-01-07 04:48:53,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:48:53,719 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:48:53,757 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_SFH_test5-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[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~#j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:48:53,860 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_SFH_test5-3.i[49681,49694] 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~mem330,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem330,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem335,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem335,],offset],IdentifierExpression[#t~mem337,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem341,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem341,],offset],IdentifierExpression[#t~mem343,]]]]] 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~mem355,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem355,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem358,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem358,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem371,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem371,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem376,],offset],IdentifierExpression[#t~mem378,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem382,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem382,],offset],IdentifierExpression[#t~mem384,]]]]] 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~mem396,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem399,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem399,],offset]]]] [2021-01-07 04:48:53,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:48:54,080 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:48:54,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54 WrapperNode [2021-01-07 04:48:54,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:48:54,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:48:54,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:48:54,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:48:54,096 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:48:54" (1/1) ... [2021-01-07 04:48:54,169 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:48:54" (1/1) ... [2021-01-07 04:48:54,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:48:54,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:48:54,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:48:54,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:48:54,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (1/1) ... [2021-01-07 04:48:54,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:48:54,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:48:54,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:48:54,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:48:54,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (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:48:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:48:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:48:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:48:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:48:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:48:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:48:54,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:48:54,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:48:54,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:48:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:48:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:48:57,106 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:48:57,107 INFO L299 CfgBuilder]: Removed 128 assume(true) statements. [2021-01-07 04:48:57,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:48:57 BoogieIcfgContainer [2021-01-07 04:48:57,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:48:57,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:48:57,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:48:57,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:48:57,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:48:52" (1/3) ... [2021-01-07 04:48:57,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f3133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:48:57, skipping insertion in model container [2021-01-07 04:48:57,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:48:54" (2/3) ... [2021-01-07 04:48:57,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785f3133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:48:57, skipping insertion in model container [2021-01-07 04:48:57,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:48:57" (3/3) ... [2021-01-07 04:48:57,120 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-3.i [2021-01-07 04:48:57,127 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:48:57,134 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 04:48:57,155 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 04:48:57,187 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:48:57,187 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:48:57,188 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:48:57,188 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:48:57,188 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:48:57,188 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:48:57,188 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:48:57,188 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:48:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states. [2021-01-07 04:48:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:48:57,220 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:48:57,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:48:57,221 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:48:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:48:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 889803109, now seen corresponding path program 1 times [2021-01-07 04:48:57,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:48:57,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556451753] [2021-01-07 04:48:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:48:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:48:57,449 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:48:57,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556451753] [2021-01-07 04:48:57,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:48:57,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:48:57,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666445190] [2021-01-07 04:48:57,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:48:57,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:48:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:48:57,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:48:57,480 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 2 states. [2021-01-07 04:48:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:48:57,541 INFO L93 Difference]: Finished difference Result 614 states and 1036 transitions. [2021-01-07 04:48:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:48:57,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:48:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:48:57,561 INFO L225 Difference]: With dead ends: 614 [2021-01-07 04:48:57,561 INFO L226 Difference]: Without dead ends: 254 [2021-01-07 04:48:57,567 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:48:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-01-07 04:48:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-01-07 04:48:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-07 04:48:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2021-01-07 04:48:57,635 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 8 [2021-01-07 04:48:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:48:57,636 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2021-01-07 04:48:57,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:48:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2021-01-07 04:48:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 04:48:57,639 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:48:57,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:48:57,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:48:57,640 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:48:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:48:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -680083191, now seen corresponding path program 1 times [2021-01-07 04:48:57,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:48:57,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310322726] [2021-01-07 04:48:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:48:57,672 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:48:57,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355436741] [2021-01-07 04:48:57,673 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:48:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:48:58,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-07 04:48:58,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:48:58,087 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:48:58,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310322726] [2021-01-07 04:48:58,089 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:48:58,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355436741] [2021-01-07 04:48:58,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:48:58,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:48:58,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022998264] [2021-01-07 04:48:58,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:48:58,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:48:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:48:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:48:58,098 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand 3 states. [2021-01-07 04:48:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:48:58,190 INFO L93 Difference]: Finished difference Result 587 states and 769 transitions. [2021-01-07 04:48:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:48:58,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-07 04:48:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:48:58,200 INFO L225 Difference]: With dead ends: 587 [2021-01-07 04:48:58,201 INFO L226 Difference]: Without dead ends: 505 [2021-01-07 04:48:58,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:48:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-01-07 04:48:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 255. [2021-01-07 04:48:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2021-01-07 04:48:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 334 transitions. [2021-01-07 04:48:58,263 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 334 transitions. Word has length 42 [2021-01-07 04:48:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:48:58,264 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 334 transitions. [2021-01-07 04:48:58,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:48:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 334 transitions. [2021-01-07 04:48:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:48:58,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:48:58,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:58,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-07 04:48:58,492 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:48:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:48:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1837409632, now seen corresponding path program 1 times [2021-01-07 04:48:58,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:48:58,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739110437] [2021-01-07 04:48:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:48:58,564 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:48:58,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470068508] [2021-01-07 04:48:58,570 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:48:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:48:58,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:48:59,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:48:59,134 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:48:59,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739110437] [2021-01-07 04:48:59,135 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:48:59,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470068508] [2021-01-07 04:48:59,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:48:59,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:48:59,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85174395] [2021-01-07 04:48:59,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:48:59,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:48:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:48:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:48:59,139 INFO L87 Difference]: Start difference. First operand 255 states and 334 transitions. Second operand 3 states. [2021-01-07 04:48:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:48:59,257 INFO L93 Difference]: Finished difference Result 528 states and 696 transitions. [2021-01-07 04:48:59,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:48:59,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:48:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:48:59,261 INFO L225 Difference]: With dead ends: 528 [2021-01-07 04:48:59,261 INFO L226 Difference]: Without dead ends: 276 [2021-01-07 04:48:59,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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:48:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-07 04:48:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2021-01-07 04:48:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2021-01-07 04:48:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2021-01-07 04:48:59,293 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 140 [2021-01-07 04:48:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:48:59,293 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2021-01-07 04:48:59,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:48:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2021-01-07 04:48:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:48:59,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:48:59,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:48:59,509 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:48:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:48:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1273244828, now seen corresponding path program 1 times [2021-01-07 04:48:59,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:48:59,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783060899] [2021-01-07 04:48:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:48:59,540 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:48:59,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080148905] [2021-01-07 04:48:59,541 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:48:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:48:59,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:48:59,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:00,116 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:49:00,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783060899] [2021-01-07 04:49:00,117 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:00,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080148905] [2021-01-07 04:49:00,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:00,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:00,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430158726] [2021-01-07 04:49:00,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:00,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:00,120 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 3 states. [2021-01-07 04:49:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:00,221 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2021-01-07 04:49:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:00,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:49:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:00,225 INFO L225 Difference]: With dead ends: 568 [2021-01-07 04:49:00,225 INFO L226 Difference]: Without dead ends: 296 [2021-01-07 04:49:00,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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:49:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-01-07 04:49:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2021-01-07 04:49:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-07 04:49:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2021-01-07 04:49:00,236 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 140 [2021-01-07 04:49:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:00,236 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2021-01-07 04:49:00,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2021-01-07 04:49:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:49:00,239 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:00,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:00,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:00,455 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash -882913824, now seen corresponding path program 1 times [2021-01-07 04:49:00,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:00,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618784900] [2021-01-07 04:49:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:00,486 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:00,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419982028] [2021-01-07 04:49:00,487 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:49:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:00,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:00,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:49:01,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618784900] [2021-01-07 04:49:01,005 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:01,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419982028] [2021-01-07 04:49:01,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:01,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:01,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7592114] [2021-01-07 04:49:01,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:01,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:01,008 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 3 states. [2021-01-07 04:49:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:01,096 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2021-01-07 04:49:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:01,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:49:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:01,099 INFO L225 Difference]: With dead ends: 397 [2021-01-07 04:49:01,099 INFO L226 Difference]: Without dead ends: 316 [2021-01-07 04:49:01,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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:49:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-07 04:49:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2021-01-07 04:49:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2021-01-07 04:49:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2021-01-07 04:49:01,109 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 140 [2021-01-07 04:49:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:01,109 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2021-01-07 04:49:01,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2021-01-07 04:49:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:49:01,111 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:01,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:01,326 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 115522276, now seen corresponding path program 1 times [2021-01-07 04:49:01,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:01,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049356166] [2021-01-07 04:49:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:01,353 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:01,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718670065] [2021-01-07 04:49:01,354 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:49:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:01,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:01,840 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:49:01,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049356166] [2021-01-07 04:49:01,841 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:01,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718670065] [2021-01-07 04:49:01,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:01,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:01,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353205203] [2021-01-07 04:49:01,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:01,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:01,845 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 4 states. [2021-01-07 04:49:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:01,950 INFO L93 Difference]: Finished difference Result 619 states and 777 transitions. [2021-01-07 04:49:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:01,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:49:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:01,953 INFO L225 Difference]: With dead ends: 619 [2021-01-07 04:49:01,953 INFO L226 Difference]: Without dead ends: 307 [2021-01-07 04:49:01,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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:49:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-07 04:49:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2021-01-07 04:49:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-01-07 04:49:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 373 transitions. [2021-01-07 04:49:01,964 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 373 transitions. Word has length 140 [2021-01-07 04:49:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:01,964 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 373 transitions. [2021-01-07 04:49:01,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 373 transitions. [2021-01-07 04:49:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:49:01,966 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:01,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-07 04:49:02,181 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 32737814, now seen corresponding path program 1 times [2021-01-07 04:49:02,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:02,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145266534] [2021-01-07 04:49:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:02,224 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:02,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670486247] [2021-01-07 04:49:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:02,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:02,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:02,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:49:02,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145266534] [2021-01-07 04:49:02,678 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:02,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670486247] [2021-01-07 04:49:02,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:02,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:02,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479776530] [2021-01-07 04:49:02,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:02,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:02,680 INFO L87 Difference]: Start difference. First operand 301 states and 373 transitions. Second operand 4 states. [2021-01-07 04:49:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:02,785 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2021-01-07 04:49:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:02,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:49:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:02,789 INFO L225 Difference]: With dead ends: 680 [2021-01-07 04:49:02,789 INFO L226 Difference]: Without dead ends: 382 [2021-01-07 04:49:02,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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:49:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-01-07 04:49:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 287. [2021-01-07 04:49:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2021-01-07 04:49:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2021-01-07 04:49:02,801 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 140 [2021-01-07 04:49:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:02,801 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2021-01-07 04:49:02,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2021-01-07 04:49:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:49:02,803 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:02,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:03,018 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash -577227484, now seen corresponding path program 1 times [2021-01-07 04:49:03,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:03,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232632403] [2021-01-07 04:49:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:03,045 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:03,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221718518] [2021-01-07 04:49:03,046 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:49:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:03,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:03,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:49:03,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232632403] [2021-01-07 04:49:03,563 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:03,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221718518] [2021-01-07 04:49:03,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:03,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:03,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769172726] [2021-01-07 04:49:03,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:03,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:03,566 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand 4 states. [2021-01-07 04:49:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:03,671 INFO L93 Difference]: Finished difference Result 379 states and 468 transitions. [2021-01-07 04:49:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:03,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:49:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:03,684 INFO L225 Difference]: With dead ends: 379 [2021-01-07 04:49:03,684 INFO L226 Difference]: Without dead ends: 278 [2021-01-07 04:49:03,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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:49:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-01-07 04:49:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2021-01-07 04:49:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2021-01-07 04:49:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2021-01-07 04:49:03,704 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 140 [2021-01-07 04:49:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:03,704 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2021-01-07 04:49:03,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2021-01-07 04:49:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:49:03,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:03,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:03,920 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1460076330, now seen corresponding path program 1 times [2021-01-07 04:49:03,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:03,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086547711] [2021-01-07 04:49:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:03,943 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:03,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779411251] [2021-01-07 04:49:03,944 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:49:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:04,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:04,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:04,517 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:49:04,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086547711] [2021-01-07 04:49:04,518 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:04,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779411251] [2021-01-07 04:49:04,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:04,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:49:04,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604928128] [2021-01-07 04:49:04,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:04,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:04,520 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 4 states. [2021-01-07 04:49:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:04,584 INFO L93 Difference]: Finished difference Result 811 states and 984 transitions. [2021-01-07 04:49:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:04,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:49:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:04,589 INFO L225 Difference]: With dead ends: 811 [2021-01-07 04:49:04,589 INFO L226 Difference]: Without dead ends: 723 [2021-01-07 04:49:04,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 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:49:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-01-07 04:49:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 455. [2021-01-07 04:49:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2021-01-07 04:49:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2021-01-07 04:49:04,610 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 140 [2021-01-07 04:49:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:04,611 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2021-01-07 04:49:04,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2021-01-07 04:49:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:49:04,615 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:04,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 04:49:04,831 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1379453485, now seen corresponding path program 2 times [2021-01-07 04:49:04,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:04,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680990923] [2021-01-07 04:49:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:04,867 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:04,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628679681] [2021-01-07 04:49:04,868 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:49:05,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:49:05,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:05,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:49:05,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:49:05,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680990923] [2021-01-07 04:49:05,645 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:05,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628679681] [2021-01-07 04:49:05,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:05,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:49:05,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212865702] [2021-01-07 04:49:05,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:49:05,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:49:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:05,647 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand 5 states. [2021-01-07 04:49:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:05,732 INFO L93 Difference]: Finished difference Result 1080 states and 1310 transitions. [2021-01-07 04:49:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:49:05,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2021-01-07 04:49:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:05,739 INFO L225 Difference]: With dead ends: 1080 [2021-01-07 04:49:05,739 INFO L226 Difference]: Without dead ends: 992 [2021-01-07 04:49:05,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 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:49:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-01-07 04:49:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 637. [2021-01-07 04:49:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2021-01-07 04:49:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2021-01-07 04:49:05,769 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 238 [2021-01-07 04:49:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:05,769 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2021-01-07 04:49:05,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:49:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2021-01-07 04:49:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2021-01-07 04:49:05,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:05,776 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:05,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:05,991 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 449267140, now seen corresponding path program 3 times [2021-01-07 04:49:05,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:05,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704047466] [2021-01-07 04:49:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:06,019 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:06,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206575540] [2021-01-07 04:49:06,020 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:49:06,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:49:06,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:06,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:06,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-01-07 04:49:06,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704047466] [2021-01-07 04:49:06,993 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:06,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206575540] [2021-01-07 04:49:06,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:06,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:06,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195819216] [2021-01-07 04:49:06,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:06,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:06,995 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 3 states. [2021-01-07 04:49:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:07,074 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2021-01-07 04:49:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:07,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2021-01-07 04:49:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:07,081 INFO L225 Difference]: With dead ends: 1216 [2021-01-07 04:49:07,081 INFO L226 Difference]: Without dead ends: 635 [2021-01-07 04:49:07,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 334 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:49:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-01-07 04:49:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2021-01-07 04:49:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2021-01-07 04:49:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 772 transitions. [2021-01-07 04:49:07,105 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 772 transitions. Word has length 336 [2021-01-07 04:49:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:07,105 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 772 transitions. [2021-01-07 04:49:07,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 772 transitions. [2021-01-07 04:49:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2021-01-07 04:49:07,111 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:07,112 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:07,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:07,326 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1855273396, now seen corresponding path program 1 times [2021-01-07 04:49:07,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:07,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648143971] [2021-01-07 04:49:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:07,354 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:07,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361077120] [2021-01-07 04:49:07,355 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:49:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:07,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:07,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-01-07 04:49:08,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648143971] [2021-01-07 04:49:08,301 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:08,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361077120] [2021-01-07 04:49:08,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:08,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:08,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189709742] [2021-01-07 04:49:08,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:08,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:08,304 INFO L87 Difference]: Start difference. First operand 635 states and 772 transitions. Second operand 3 states. [2021-01-07 04:49:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:08,377 INFO L93 Difference]: Finished difference Result 1232 states and 1512 transitions. [2021-01-07 04:49:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:08,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2021-01-07 04:49:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:08,381 INFO L225 Difference]: With dead ends: 1232 [2021-01-07 04:49:08,381 INFO L226 Difference]: Without dead ends: 647 [2021-01-07 04:49:08,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 341 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:49:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-01-07 04:49:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2021-01-07 04:49:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2021-01-07 04:49:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2021-01-07 04:49:08,407 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 343 [2021-01-07 04:49:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:08,408 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2021-01-07 04:49:08,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2021-01-07 04:49:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-01-07 04:49:08,415 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:08,416 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:08,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 04:49:08,632 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 162679507, now seen corresponding path program 1 times [2021-01-07 04:49:08,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:08,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948585857] [2021-01-07 04:49:08,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:08,663 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:08,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118126462] [2021-01-07 04:49:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:09,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:49:09,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-01-07 04:49:09,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948585857] [2021-01-07 04:49:09,598 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:09,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118126462] [2021-01-07 04:49:09,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:09,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:49:09,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272087767] [2021-01-07 04:49:09,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:09,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:09,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:09,601 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand 4 states. [2021-01-07 04:49:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:09,674 INFO L93 Difference]: Finished difference Result 1255 states and 1535 transitions. [2021-01-07 04:49:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:09,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2021-01-07 04:49:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:09,678 INFO L225 Difference]: With dead ends: 1255 [2021-01-07 04:49:09,678 INFO L226 Difference]: Without dead ends: 659 [2021-01-07 04:49:09,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 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:49:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-01-07 04:49:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2021-01-07 04:49:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2021-01-07 04:49:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 796 transitions. [2021-01-07 04:49:09,700 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 796 transitions. Word has length 345 [2021-01-07 04:49:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:09,701 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 796 transitions. [2021-01-07 04:49:09,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 796 transitions. [2021-01-07 04:49:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2021-01-07 04:49:09,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:09,704 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:09,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:49:09,918 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1649703700, now seen corresponding path program 2 times [2021-01-07 04:49:09,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:09,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567112480] [2021-01-07 04:49:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:09,944 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:09,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864747442] [2021-01-07 04:49:09,945 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 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 [2021-01-07 04:49:10,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:49:10,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:10,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:10,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-01-07 04:49:10,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567112480] [2021-01-07 04:49:10,991 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:10,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864747442] [2021-01-07 04:49:10,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:10,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:49:10,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623061918] [2021-01-07 04:49:10,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:49:10,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:49:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:10,993 INFO L87 Difference]: Start difference. First operand 659 states and 796 transitions. Second operand 5 states. [2021-01-07 04:49:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:11,089 INFO L93 Difference]: Finished difference Result 1278 states and 1558 transitions. [2021-01-07 04:49:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:49:11,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2021-01-07 04:49:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:11,093 INFO L225 Difference]: With dead ends: 1278 [2021-01-07 04:49:11,093 INFO L226 Difference]: Without dead ends: 671 [2021-01-07 04:49:11,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 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:49:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-01-07 04:49:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2021-01-07 04:49:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2021-01-07 04:49:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 808 transitions. [2021-01-07 04:49:11,117 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 808 transitions. Word has length 347 [2021-01-07 04:49:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:11,118 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 808 transitions. [2021-01-07 04:49:11,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:49:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 808 transitions. [2021-01-07 04:49:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2021-01-07 04:49:11,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:11,121 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:11,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:49:11,335 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:11,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 457445491, now seen corresponding path program 3 times [2021-01-07 04:49:11,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:11,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60093847] [2021-01-07 04:49:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:11,365 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:11,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765123728] [2021-01-07 04:49:11,365 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:11,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:49:11,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:11,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:11,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2021-01-07 04:49:12,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60093847] [2021-01-07 04:49:12,530 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:12,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765123728] [2021-01-07 04:49:12,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:12,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:12,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53488694] [2021-01-07 04:49:12,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:12,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:12,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:12,533 INFO L87 Difference]: Start difference. First operand 671 states and 808 transitions. Second operand 3 states. [2021-01-07 04:49:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:12,686 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2021-01-07 04:49:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:12,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2021-01-07 04:49:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:12,691 INFO L225 Difference]: With dead ends: 1256 [2021-01-07 04:49:12,691 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:49:12,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 347 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:49:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:49:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2021-01-07 04:49:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2021-01-07 04:49:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 880 transitions. [2021-01-07 04:49:12,730 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 880 transitions. Word has length 349 [2021-01-07 04:49:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:12,730 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 880 transitions. [2021-01-07 04:49:12,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 880 transitions. [2021-01-07 04:49:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2021-01-07 04:49:12,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:12,735 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:49:12,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:12,949 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2060178602, now seen corresponding path program 1 times [2021-01-07 04:49:12,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:12,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676412087] [2021-01-07 04:49:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:12,981 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:12,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825804807] [2021-01-07 04:49:12,982 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:13,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:49:13,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-01-07 04:49:13,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676412087] [2021-01-07 04:49:13,994 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:13,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825804807] [2021-01-07 04:49:13,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:13,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:49:13,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404850284] [2021-01-07 04:49:13,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:49:13,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:49:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:49:13,998 INFO L87 Difference]: Start difference. First operand 728 states and 880 transitions. Second operand 6 states. [2021-01-07 04:49:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:14,147 INFO L93 Difference]: Finished difference Result 1415 states and 1725 transitions. [2021-01-07 04:49:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:49:14,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2021-01-07 04:49:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:14,151 INFO L225 Difference]: With dead ends: 1415 [2021-01-07 04:49:14,151 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:49:14,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 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:49:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:49:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-01-07 04:49:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2021-01-07 04:49:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 892 transitions. [2021-01-07 04:49:14,181 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 892 transitions. Word has length 362 [2021-01-07 04:49:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:14,182 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 892 transitions. [2021-01-07 04:49:14,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:49:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 892 transitions. [2021-01-07 04:49:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-01-07 04:49:14,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:14,185 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:49:14,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 04:49:14,399 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1507573012, now seen corresponding path program 2 times [2021-01-07 04:49:14,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:14,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065610398] [2021-01-07 04:49:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:14,429 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:14,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513496625] [2021-01-07 04:49:14,430 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:15,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:49:15,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:15,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:49:15,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-01-07 04:49:15,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065610398] [2021-01-07 04:49:15,565 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:15,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513496625] [2021-01-07 04:49:15,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:15,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:49:15,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103399637] [2021-01-07 04:49:15,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:49:15,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:49:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:49:15,568 INFO L87 Difference]: Start difference. First operand 740 states and 892 transitions. Second operand 7 states. [2021-01-07 04:49:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:15,752 INFO L93 Difference]: Finished difference Result 1438 states and 1748 transitions. [2021-01-07 04:49:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:49:15,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2021-01-07 04:49:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:15,757 INFO L225 Difference]: With dead ends: 1438 [2021-01-07 04:49:15,757 INFO L226 Difference]: Without dead ends: 752 [2021-01-07 04:49:15,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 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:49:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-01-07 04:49:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2021-01-07 04:49:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2021-01-07 04:49:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 904 transitions. [2021-01-07 04:49:15,785 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 904 transitions. Word has length 366 [2021-01-07 04:49:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:15,786 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 904 transitions. [2021-01-07 04:49:15,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:49:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 904 transitions. [2021-01-07 04:49:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-01-07 04:49:15,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:15,791 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:49:16,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 04:49:16,006 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 823733142, now seen corresponding path program 3 times [2021-01-07 04:49:16,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:16,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688464079] [2021-01-07 04:49:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:16,038 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:16,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726721257] [2021-01-07 04:49:16,038 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:16,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:49:16,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:16,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:16,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2021-01-07 04:49:17,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688464079] [2021-01-07 04:49:17,035 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:17,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726721257] [2021-01-07 04:49:17,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:17,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:17,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446591980] [2021-01-07 04:49:17,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:17,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:17,040 INFO L87 Difference]: Start difference. First operand 752 states and 904 transitions. Second operand 3 states. [2021-01-07 04:49:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:17,172 INFO L93 Difference]: Finished difference Result 1376 states and 1653 transitions. [2021-01-07 04:49:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:17,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2021-01-07 04:49:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:17,177 INFO L225 Difference]: With dead ends: 1376 [2021-01-07 04:49:17,177 INFO L226 Difference]: Without dead ends: 1027 [2021-01-07 04:49:17,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 368 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:49:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-01-07 04:49:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2021-01-07 04:49:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2021-01-07 04:49:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1222 transitions. [2021-01-07 04:49:17,215 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1222 transitions. Word has length 370 [2021-01-07 04:49:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:17,216 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1222 transitions. [2021-01-07 04:49:17,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1222 transitions. [2021-01-07 04:49:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2021-01-07 04:49:17,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:17,220 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:17,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 04:49:17,436 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -145231630, now seen corresponding path program 1 times [2021-01-07 04:49:17,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:17,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303441095] [2021-01-07 04:49:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:17,472 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:17,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812237715] [2021-01-07 04:49:17,472 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:18,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 04:49:18,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-01-07 04:49:18,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303441095] [2021-01-07 04:49:18,521 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:18,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812237715] [2021-01-07 04:49:18,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:18,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-07 04:49:18,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62545641] [2021-01-07 04:49:18,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:49:18,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:49:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:49:18,524 INFO L87 Difference]: Start difference. First operand 1015 states and 1222 transitions. Second operand 8 states. [2021-01-07 04:49:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:18,684 INFO L93 Difference]: Finished difference Result 1989 states and 2411 transitions. [2021-01-07 04:49:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:49:18,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2021-01-07 04:49:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:18,691 INFO L225 Difference]: With dead ends: 1989 [2021-01-07 04:49:18,691 INFO L226 Difference]: Without dead ends: 1029 [2021-01-07 04:49:18,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:49:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-01-07 04:49:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2021-01-07 04:49:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2021-01-07 04:49:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1236 transitions. [2021-01-07 04:49:18,739 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1236 transitions. Word has length 377 [2021-01-07 04:49:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:18,739 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1236 transitions. [2021-01-07 04:49:18,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:49:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1236 transitions. [2021-01-07 04:49:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2021-01-07 04:49:18,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:18,745 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:18,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:18,961 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1700907916, now seen corresponding path program 2 times [2021-01-07 04:49:18,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:18,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728478937] [2021-01-07 04:49:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:18,997 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:18,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305509255] [2021-01-07 04:49:18,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:19,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:49:19,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:49:19,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:49:19,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 73 proven. 21 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-01-07 04:49:20,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728478937] [2021-01-07 04:49:20,121 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:20,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305509255] [2021-01-07 04:49:20,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:20,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-07 04:49:20,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433132561] [2021-01-07 04:49:20,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:49:20,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:49:20,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:49:20,123 INFO L87 Difference]: Start difference. First operand 1029 states and 1236 transitions. Second operand 9 states. [2021-01-07 04:49:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:20,258 INFO L93 Difference]: Finished difference Result 2016 states and 2438 transitions. [2021-01-07 04:49:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:49:20,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2021-01-07 04:49:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:20,264 INFO L225 Difference]: With dead ends: 2016 [2021-01-07 04:49:20,264 INFO L226 Difference]: Without dead ends: 1043 [2021-01-07 04:49:20,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:49:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-01-07 04:49:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2021-01-07 04:49:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2021-01-07 04:49:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1250 transitions. [2021-01-07 04:49:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1250 transitions. Word has length 381 [2021-01-07 04:49:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:20,337 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1250 transitions. [2021-01-07 04:49:20,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:49:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1250 transitions. [2021-01-07 04:49:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-01-07 04:49:20,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:20,341 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:20,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:20,552 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -336611150, now seen corresponding path program 3 times [2021-01-07 04:49:20,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:20,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212228685] [2021-01-07 04:49:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:20,583 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:20,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201564911] [2021-01-07 04:49:20,583 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true