/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:36:21,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:36:21,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:36:21,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:36:21,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:36:21,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:36:21,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:36:21,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:36:21,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:36:21,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:36:21,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:36:21,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:36:21,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:36:21,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:36:21,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:36:21,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:36:21,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:36:21,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:36:21,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:36:21,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:36:21,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:36:21,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:36:21,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:36:21,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:36:21,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:36:21,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:36:21,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:36:21,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:36:21,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:36:21,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:36:21,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:36:21,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:36:21,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:36:21,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:36:21,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:36:21,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:36:21,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:36:21,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:36:21,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:36:21,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:36:21,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:36:21,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 16:36:21,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:36:21,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:36:21,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:36:21,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:36:21,550 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:36:21,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:36:21,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:36:21,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:36:21,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:36:21,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:36:21,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:36:21,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:36:21,552 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:36:21,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:36:21,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:36:21,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:36:21,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:36:21,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:36:21,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:36:21,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:36:21,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:36:21,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:36:21,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:36:21,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:36:21,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:36:21,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 16:36:22,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:36:22,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:36:22,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:36:22,088 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:36:22,089 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:36:22,090 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-1.i [2020-12-23 16:36:22,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/306f5e474/64ae48414acd4c1a831dc2a931cebaa8/FLAG9a7c12728 [2020-12-23 16:36:23,094 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:36:23,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2020-12-23 16:36:23,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/306f5e474/64ae48414acd4c1a831dc2a931cebaa8/FLAG9a7c12728 [2020-12-23 16:36:23,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/306f5e474/64ae48414acd4c1a831dc2a931cebaa8 [2020-12-23 16:36:23,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:36:23,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:36:23,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:36:23,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:36:23,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:36:23,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:36:23" (1/1) ... [2020-12-23 16:36:23,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4771e8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:23, skipping insertion in model container [2020-12-23 16:36:23,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:36:23" (1/1) ... [2020-12-23 16:36:23,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:36:23,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:36:23,898 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-1.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,] [2020-12-23 16:36:24,144 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-1.i[49681,49694] [2020-12-23 16:36:24,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:36:24,168 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:36:24,248 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-1.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,] [2020-12-23 16:36:24,415 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-1.i[49681,49694] [2020-12-23 16:36:24,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:36:24,523 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:36:24,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24 WrapperNode [2020-12-23 16:36:24,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:36:24,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:36:24,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:36:24,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:36:24,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:36:24,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:36:24,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:36:24,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:36:24,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:24,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... [2020-12-23 16:36:25,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:36:25,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:36:25,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:36:25,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:36:25,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:36:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:36:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:36:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:36:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:36:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:36:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 16:36:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:36:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:36:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:36:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:36:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:36:27,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:36:27,425 INFO L299 CfgBuilder]: Removed 111 assume(true) statements. [2020-12-23 16:36:27,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:36:27 BoogieIcfgContainer [2020-12-23 16:36:27,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:36:27,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:36:27,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:36:27,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:36:27,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:36:23" (1/3) ... [2020-12-23 16:36:27,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3183ff27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:36:27, skipping insertion in model container [2020-12-23 16:36:27,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:36:24" (2/3) ... [2020-12-23 16:36:27,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3183ff27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:36:27, skipping insertion in model container [2020-12-23 16:36:27,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:36:27" (3/3) ... [2020-12-23 16:36:27,453 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2020-12-23 16:36:27,459 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:36:27,464 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-12-23 16:36:27,481 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 16:36:27,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:36:27,513 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:36:27,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:36:27,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:36:27,514 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:36:27,514 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:36:27,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:36:27,514 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:36:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states. [2020-12-23 16:36:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-23 16:36:27,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:27,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:36:27,549 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]=== [2020-12-23 16:36:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:27,556 INFO L82 PathProgramCache]: Analyzing trace with hash 889803109, now seen corresponding path program 1 times [2020-12-23 16:36:27,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:27,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597693842] [2020-12-23 16:36:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:27,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597693842] [2020-12-23 16:36:27,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:27,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:36:27,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741173447] [2020-12-23 16:36:27,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:36:27,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:27,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:36:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:36:27,781 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 2 states. [2020-12-23 16:36:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:27,851 INFO L93 Difference]: Finished difference Result 514 states and 864 transitions. [2020-12-23 16:36:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:36:27,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-23 16:36:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:27,882 INFO L225 Difference]: With dead ends: 514 [2020-12-23 16:36:27,882 INFO L226 Difference]: Without dead ends: 254 [2020-12-23 16:36:27,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:36:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-23 16:36:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2020-12-23 16:36:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-12-23 16:36:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2020-12-23 16:36:27,970 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 8 [2020-12-23 16:36:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:27,971 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2020-12-23 16:36:27,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:36:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2020-12-23 16:36:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 16:36:27,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:27,974 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] [2020-12-23 16:36:27,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:36:27,974 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]=== [2020-12-23 16:36:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -680083191, now seen corresponding path program 1 times [2020-12-23 16:36:27,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:27,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418049104] [2020-12-23 16:36:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:28,001 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:28,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632806516] [2020-12-23 16:36:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:28,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 16:36:28,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:28,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418049104] [2020-12-23 16:36:28,286 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:28,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632806516] [2020-12-23 16:36:28,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:28,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:28,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823237440] [2020-12-23 16:36:28,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:28,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:28,291 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand 3 states. [2020-12-23 16:36:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:28,370 INFO L93 Difference]: Finished difference Result 587 states and 769 transitions. [2020-12-23 16:36:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:28,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-12-23 16:36:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:28,375 INFO L225 Difference]: With dead ends: 587 [2020-12-23 16:36:28,376 INFO L226 Difference]: Without dead ends: 505 [2020-12-23 16:36:28,377 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 [2020-12-23 16:36:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-12-23 16:36:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 255. [2020-12-23 16:36:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-12-23 16:36:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 334 transitions. [2020-12-23 16:36:28,405 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 334 transitions. Word has length 42 [2020-12-23 16:36:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:28,406 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 334 transitions. [2020-12-23 16:36:28,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 334 transitions. [2020-12-23 16:36:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:28,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:28,422 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] [2020-12-23 16:36:28,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-23 16:36:28,638 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]=== [2020-12-23 16:36:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:28,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1837409632, now seen corresponding path program 1 times [2020-12-23 16:36:28,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:28,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027216542] [2020-12-23 16:36:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:28,675 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:28,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715421469] [2020-12-23 16:36:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:29,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:29,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:29,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027216542] [2020-12-23 16:36:29,218 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:29,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715421469] [2020-12-23 16:36:29,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:29,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:29,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210210264] [2020-12-23 16:36:29,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:29,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:29,222 INFO L87 Difference]: Start difference. First operand 255 states and 334 transitions. Second operand 3 states. [2020-12-23 16:36:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:29,358 INFO L93 Difference]: Finished difference Result 528 states and 696 transitions. [2020-12-23 16:36:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:29,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:36:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:29,362 INFO L225 Difference]: With dead ends: 528 [2020-12-23 16:36:29,362 INFO L226 Difference]: Without dead ends: 276 [2020-12-23 16:36:29,363 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 [2020-12-23 16:36:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-12-23 16:36:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2020-12-23 16:36:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-12-23 16:36:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2020-12-23 16:36:29,383 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 140 [2020-12-23 16:36:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:29,384 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2020-12-23 16:36:29,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2020-12-23 16:36:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:29,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:29,392 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] [2020-12-23 16:36:29,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:29,606 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]=== [2020-12-23 16:36:29,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1273244828, now seen corresponding path program 1 times [2020-12-23 16:36:29,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:29,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539603667] [2020-12-23 16:36:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:29,665 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:29,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293681738] [2020-12-23 16:36:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:29,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:29,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:30,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539603667] [2020-12-23 16:36:30,161 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:30,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293681738] [2020-12-23 16:36:30,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:30,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:30,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816090045] [2020-12-23 16:36:30,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:30,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:30,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:30,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:30,167 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 3 states. [2020-12-23 16:36:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:30,271 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2020-12-23 16:36:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:30,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:36:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:30,274 INFO L225 Difference]: With dead ends: 568 [2020-12-23 16:36:30,274 INFO L226 Difference]: Without dead ends: 296 [2020-12-23 16:36:30,276 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 [2020-12-23 16:36:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-12-23 16:36:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2020-12-23 16:36:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-12-23 16:36:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2020-12-23 16:36:30,291 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 140 [2020-12-23 16:36:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:30,292 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2020-12-23 16:36:30,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2020-12-23 16:36:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:30,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:30,298 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] [2020-12-23 16:36:30,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:30,513 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]=== [2020-12-23 16:36:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:30,514 INFO L82 PathProgramCache]: Analyzing trace with hash -882913824, now seen corresponding path program 1 times [2020-12-23 16:36:30,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:30,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635900508] [2020-12-23 16:36:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:30,568 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:30,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723485228] [2020-12-23 16:36:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:30,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:36:31,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635900508] [2020-12-23 16:36:31,076 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:31,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723485228] [2020-12-23 16:36:31,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:31,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:31,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039106543] [2020-12-23 16:36:31,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:31,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:31,079 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 3 states. [2020-12-23 16:36:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:31,210 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2020-12-23 16:36:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:31,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2020-12-23 16:36:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:31,220 INFO L225 Difference]: With dead ends: 397 [2020-12-23 16:36:31,220 INFO L226 Difference]: Without dead ends: 316 [2020-12-23 16:36:31,224 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 [2020-12-23 16:36:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-12-23 16:36:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2020-12-23 16:36:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-23 16:36:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2020-12-23 16:36:31,260 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 140 [2020-12-23 16:36:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:31,262 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2020-12-23 16:36:31,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2020-12-23 16:36:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:31,279 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:31,279 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] [2020-12-23 16:36:31,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:31,481 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]=== [2020-12-23 16:36:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash 115522276, now seen corresponding path program 1 times [2020-12-23 16:36:31,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:31,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132086102] [2020-12-23 16:36:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:31,526 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:31,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005154485] [2020-12-23 16:36:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:31,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:31,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:32,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132086102] [2020-12-23 16:36:32,002 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:32,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005154485] [2020-12-23 16:36:32,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:32,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:36:32,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157218401] [2020-12-23 16:36:32,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:36:32,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:32,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:36:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:36:32,012 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 4 states. [2020-12-23 16:36:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:32,123 INFO L93 Difference]: Finished difference Result 619 states and 777 transitions. [2020-12-23 16:36:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:36:32,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:36:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:32,128 INFO L225 Difference]: With dead ends: 619 [2020-12-23 16:36:32,128 INFO L226 Difference]: Without dead ends: 307 [2020-12-23 16:36:32,130 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 [2020-12-23 16:36:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-23 16:36:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2020-12-23 16:36:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-12-23 16:36:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 373 transitions. [2020-12-23 16:36:32,144 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 373 transitions. Word has length 140 [2020-12-23 16:36:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:32,146 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 373 transitions. [2020-12-23 16:36:32,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:36:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 373 transitions. [2020-12-23 16:36:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:32,157 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:32,157 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] [2020-12-23 16:36:32,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-23 16:36:32,372 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]=== [2020-12-23 16:36:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash 32737814, now seen corresponding path program 1 times [2020-12-23 16:36:32,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:32,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300683505] [2020-12-23 16:36:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:32,423 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:32,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254722993] [2020-12-23 16:36:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:32,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:32,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:32,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300683505] [2020-12-23 16:36:32,905 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:32,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254722993] [2020-12-23 16:36:32,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:32,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:36:32,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801225801] [2020-12-23 16:36:32,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:36:32,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:36:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:36:32,909 INFO L87 Difference]: Start difference. First operand 301 states and 373 transitions. Second operand 4 states. [2020-12-23 16:36:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:33,060 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2020-12-23 16:36:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:36:33,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:36:33,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:33,064 INFO L225 Difference]: With dead ends: 680 [2020-12-23 16:36:33,065 INFO L226 Difference]: Without dead ends: 382 [2020-12-23 16:36:33,066 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 [2020-12-23 16:36:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-12-23 16:36:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 287. [2020-12-23 16:36:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-12-23 16:36:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2020-12-23 16:36:33,079 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 140 [2020-12-23 16:36:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:33,079 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2020-12-23 16:36:33,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:36:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2020-12-23 16:36:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:33,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:33,083 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] [2020-12-23 16:36:33,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:33,299 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]=== [2020-12-23 16:36:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash -577227484, now seen corresponding path program 1 times [2020-12-23 16:36:33,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:33,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016622945] [2020-12-23 16:36:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:33,325 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:33,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481966155] [2020-12-23 16:36:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:33,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:36:33,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016622945] [2020-12-23 16:36:33,799 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:33,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481966155] [2020-12-23 16:36:33,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:33,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:36:33,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98922013] [2020-12-23 16:36:33,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:36:33,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:33,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:36:33,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:36:33,802 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand 4 states. [2020-12-23 16:36:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:33,893 INFO L93 Difference]: Finished difference Result 379 states and 468 transitions. [2020-12-23 16:36:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:36:33,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:36:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:33,896 INFO L225 Difference]: With dead ends: 379 [2020-12-23 16:36:33,896 INFO L226 Difference]: Without dead ends: 278 [2020-12-23 16:36:33,897 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 [2020-12-23 16:36:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-12-23 16:36:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2020-12-23 16:36:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-12-23 16:36:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2020-12-23 16:36:33,906 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 140 [2020-12-23 16:36:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:33,907 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2020-12-23 16:36:33,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:36:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2020-12-23 16:36:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 16:36:33,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:33,909 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] [2020-12-23 16:36:34,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:34,125 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]=== [2020-12-23 16:36:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1460076330, now seen corresponding path program 1 times [2020-12-23 16:36:34,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:34,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36071440] [2020-12-23 16:36:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:34,146 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:34,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52900437] [2020-12-23 16:36:34,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:34,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:34,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:34,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36071440] [2020-12-23 16:36:34,625 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:34,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52900437] [2020-12-23 16:36:34,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:34,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:36:34,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578132117] [2020-12-23 16:36:34,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:36:34,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:36:34,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:36:34,627 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 4 states. [2020-12-23 16:36:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:34,691 INFO L93 Difference]: Finished difference Result 811 states and 984 transitions. [2020-12-23 16:36:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:36:34,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-23 16:36:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:34,696 INFO L225 Difference]: With dead ends: 811 [2020-12-23 16:36:34,696 INFO L226 Difference]: Without dead ends: 723 [2020-12-23 16:36:34,697 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 [2020-12-23 16:36:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-12-23 16:36:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 455. [2020-12-23 16:36:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-12-23 16:36:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2020-12-23 16:36:34,721 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 140 [2020-12-23 16:36:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:34,721 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2020-12-23 16:36:34,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:36:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2020-12-23 16:36:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-12-23 16:36:34,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:34,725 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] [2020-12-23 16:36:34,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 16:36:34,939 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]=== [2020-12-23 16:36:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1379453485, now seen corresponding path program 2 times [2020-12-23 16:36:34,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:34,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514130966] [2020-12-23 16:36:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:34,966 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:34,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326664722] [2020-12-23 16:36:34,966 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 [2020-12-23 16:36:35,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:36:35,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:35,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:36:35,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:36:35,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514130966] [2020-12-23 16:36:35,780 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:35,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326664722] [2020-12-23 16:36:35,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:35,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:36:35,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678165888] [2020-12-23 16:36:35,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:36:35,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:36:35,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:36:35,783 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand 5 states. [2020-12-23 16:36:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:35,867 INFO L93 Difference]: Finished difference Result 1080 states and 1310 transitions. [2020-12-23 16:36:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:36:35,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2020-12-23 16:36:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:35,874 INFO L225 Difference]: With dead ends: 1080 [2020-12-23 16:36:35,874 INFO L226 Difference]: Without dead ends: 992 [2020-12-23 16:36:35,875 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 [2020-12-23 16:36:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2020-12-23 16:36:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 637. [2020-12-23 16:36:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-12-23 16:36:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2020-12-23 16:36:35,901 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 238 [2020-12-23 16:36:35,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:35,902 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2020-12-23 16:36:35,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:36:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2020-12-23 16:36:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2020-12-23 16:36:35,908 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:35,908 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] [2020-12-23 16:36:36,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:36,124 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]=== [2020-12-23 16:36:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 449267140, now seen corresponding path program 3 times [2020-12-23 16:36:36,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:36,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161782191] [2020-12-23 16:36:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:36,152 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:36,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402136374] [2020-12-23 16:36:36,153 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 [2020-12-23 16:36:36,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:36:36,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:36,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:36:36,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-12-23 16:36:37,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161782191] [2020-12-23 16:36:37,198 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:37,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402136374] [2020-12-23 16:36:37,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:37,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:37,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066588988] [2020-12-23 16:36:37,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:37,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:37,200 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 3 states. [2020-12-23 16:36:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:37,264 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2020-12-23 16:36:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:37,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2020-12-23 16:36:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:37,270 INFO L225 Difference]: With dead ends: 1216 [2020-12-23 16:36:37,270 INFO L226 Difference]: Without dead ends: 635 [2020-12-23 16:36:37,272 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 [2020-12-23 16:36:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-12-23 16:36:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2020-12-23 16:36:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2020-12-23 16:36:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 772 transitions. [2020-12-23 16:36:37,295 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 772 transitions. Word has length 336 [2020-12-23 16:36:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:37,296 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 772 transitions. [2020-12-23 16:36:37,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 772 transitions. [2020-12-23 16:36:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2020-12-23 16:36:37,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:37,303 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] [2020-12-23 16:36:37,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:37,519 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]=== [2020-12-23 16:36:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1855273396, now seen corresponding path program 1 times [2020-12-23 16:36:37,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:37,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969411348] [2020-12-23 16:36:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:37,550 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:37,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650475475] [2020-12-23 16:36:37,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:38,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:36:38,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2020-12-23 16:36:38,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969411348] [2020-12-23 16:36:38,441 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:38,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650475475] [2020-12-23 16:36:38,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:38,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:38,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251855042] [2020-12-23 16:36:38,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:38,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:38,444 INFO L87 Difference]: Start difference. First operand 635 states and 772 transitions. Second operand 3 states. [2020-12-23 16:36:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:38,504 INFO L93 Difference]: Finished difference Result 1232 states and 1512 transitions. [2020-12-23 16:36:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:38,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2020-12-23 16:36:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:38,509 INFO L225 Difference]: With dead ends: 1232 [2020-12-23 16:36:38,509 INFO L226 Difference]: Without dead ends: 647 [2020-12-23 16:36:38,510 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 [2020-12-23 16:36:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2020-12-23 16:36:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2020-12-23 16:36:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-12-23 16:36:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2020-12-23 16:36:38,532 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 343 [2020-12-23 16:36:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:38,533 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2020-12-23 16:36:38,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2020-12-23 16:36:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-12-23 16:36:38,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:38,540 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] [2020-12-23 16:36:38,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 16:36:38,754 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]=== [2020-12-23 16:36:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 162679507, now seen corresponding path program 1 times [2020-12-23 16:36:38,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:38,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607253319] [2020-12-23 16:36:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:38,818 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:38,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268275381] [2020-12-23 16:36:38,819 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 [2020-12-23 16:36:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:39,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:36:39,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-12-23 16:36:39,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607253319] [2020-12-23 16:36:39,754 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:39,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268275381] [2020-12-23 16:36:39,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:39,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:36:39,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562838896] [2020-12-23 16:36:39,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:36:39,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:36:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:36:39,762 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand 4 states. [2020-12-23 16:36:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:39,836 INFO L93 Difference]: Finished difference Result 1255 states and 1535 transitions. [2020-12-23 16:36:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:36:39,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2020-12-23 16:36:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:39,840 INFO L225 Difference]: With dead ends: 1255 [2020-12-23 16:36:39,841 INFO L226 Difference]: Without dead ends: 659 [2020-12-23 16:36:39,843 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 [2020-12-23 16:36:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-12-23 16:36:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2020-12-23 16:36:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-12-23 16:36:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 796 transitions. [2020-12-23 16:36:39,867 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 796 transitions. Word has length 345 [2020-12-23 16:36:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:39,867 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 796 transitions. [2020-12-23 16:36:39,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:36:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 796 transitions. [2020-12-23 16:36:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2020-12-23 16:36:39,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:39,871 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] [2020-12-23 16:36:40,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:36:40,088 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]=== [2020-12-23 16:36:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1649703700, now seen corresponding path program 2 times [2020-12-23 16:36:40,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:40,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370734438] [2020-12-23 16:36:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:40,116 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:40,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395040393] [2020-12-23 16:36:40,116 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 [2020-12-23 16:36:40,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:36:40,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:40,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:36:40,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2020-12-23 16:36:41,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370734438] [2020-12-23 16:36:41,174 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:41,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395040393] [2020-12-23 16:36:41,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:41,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:36:41,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257099683] [2020-12-23 16:36:41,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:36:41,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:36:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:36:41,177 INFO L87 Difference]: Start difference. First operand 659 states and 796 transitions. Second operand 5 states. [2020-12-23 16:36:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:41,275 INFO L93 Difference]: Finished difference Result 1278 states and 1558 transitions. [2020-12-23 16:36:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:36:41,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2020-12-23 16:36:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:41,281 INFO L225 Difference]: With dead ends: 1278 [2020-12-23 16:36:41,281 INFO L226 Difference]: Without dead ends: 671 [2020-12-23 16:36:41,283 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 [2020-12-23 16:36:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2020-12-23 16:36:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2020-12-23 16:36:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2020-12-23 16:36:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 808 transitions. [2020-12-23 16:36:41,312 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 808 transitions. Word has length 347 [2020-12-23 16:36:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:41,313 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 808 transitions. [2020-12-23 16:36:41,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:36:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 808 transitions. [2020-12-23 16:36:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-12-23 16:36:41,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:41,318 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] [2020-12-23 16:36:41,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:36:41,532 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]=== [2020-12-23 16:36:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 457445491, now seen corresponding path program 3 times [2020-12-23 16:36:41,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:41,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996785451] [2020-12-23 16:36:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:41,562 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:41,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122597533] [2020-12-23 16:36:41,563 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 [2020-12-23 16:36:41,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:36:41,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:41,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:36:41,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2020-12-23 16:36:42,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996785451] [2020-12-23 16:36:42,528 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:42,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122597533] [2020-12-23 16:36:42,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:42,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:42,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338081465] [2020-12-23 16:36:42,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:42,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:42,529 INFO L87 Difference]: Start difference. First operand 671 states and 808 transitions. Second operand 3 states. [2020-12-23 16:36:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:42,600 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2020-12-23 16:36:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:42,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2020-12-23 16:36:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:42,604 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 16:36:42,605 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:36:42,606 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 [2020-12-23 16:36:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:36:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2020-12-23 16:36:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-12-23 16:36:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 880 transitions. [2020-12-23 16:36:42,633 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 880 transitions. Word has length 349 [2020-12-23 16:36:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:42,634 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 880 transitions. [2020-12-23 16:36:42,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 880 transitions. [2020-12-23 16:36:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2020-12-23 16:36:42,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:42,638 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] [2020-12-23 16:36:42,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:42,852 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]=== [2020-12-23 16:36:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2060178602, now seen corresponding path program 1 times [2020-12-23 16:36:42,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:42,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814197416] [2020-12-23 16:36:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:42,881 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:42,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707444877] [2020-12-23 16:36:42,881 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 [2020-12-23 16:36:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:43,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:36:43,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-12-23 16:36:43,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814197416] [2020-12-23 16:36:43,869 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:43,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707444877] [2020-12-23 16:36:43,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:43,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:36:43,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36013810] [2020-12-23 16:36:43,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:36:43,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:36:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:36:43,871 INFO L87 Difference]: Start difference. First operand 728 states and 880 transitions. Second operand 6 states. [2020-12-23 16:36:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:43,971 INFO L93 Difference]: Finished difference Result 1415 states and 1725 transitions. [2020-12-23 16:36:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:36:43,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2020-12-23 16:36:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:43,976 INFO L225 Difference]: With dead ends: 1415 [2020-12-23 16:36:43,976 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:36:43,977 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 [2020-12-23 16:36:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:36:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 16:36:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 16:36:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 892 transitions. [2020-12-23 16:36:44,009 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 892 transitions. Word has length 362 [2020-12-23 16:36:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:44,009 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 892 transitions. [2020-12-23 16:36:44,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:36:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 892 transitions. [2020-12-23 16:36:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2020-12-23 16:36:44,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:44,013 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] [2020-12-23 16:36:44,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 16:36:44,228 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]=== [2020-12-23 16:36:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1507573012, now seen corresponding path program 2 times [2020-12-23 16:36:44,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:44,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026154647] [2020-12-23 16:36:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:44,260 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:44,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79160908] [2020-12-23 16:36:44,261 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 [2020-12-23 16:36:44,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:36:44,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:44,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:36:44,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2020-12-23 16:36:45,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026154647] [2020-12-23 16:36:45,314 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:45,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79160908] [2020-12-23 16:36:45,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:45,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:36:45,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684779093] [2020-12-23 16:36:45,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:36:45,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:36:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:36:45,316 INFO L87 Difference]: Start difference. First operand 740 states and 892 transitions. Second operand 7 states. [2020-12-23 16:36:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:45,431 INFO L93 Difference]: Finished difference Result 1438 states and 1748 transitions. [2020-12-23 16:36:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:36:45,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2020-12-23 16:36:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:45,435 INFO L225 Difference]: With dead ends: 1438 [2020-12-23 16:36:45,435 INFO L226 Difference]: Without dead ends: 752 [2020-12-23 16:36:45,437 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 [2020-12-23 16:36:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-12-23 16:36:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2020-12-23 16:36:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2020-12-23 16:36:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 904 transitions. [2020-12-23 16:36:45,468 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 904 transitions. Word has length 366 [2020-12-23 16:36:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:45,468 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 904 transitions. [2020-12-23 16:36:45,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:36:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 904 transitions. [2020-12-23 16:36:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2020-12-23 16:36:45,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:45,472 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] [2020-12-23 16:36:45,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 16:36:45,681 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]=== [2020-12-23 16:36:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash 823733142, now seen corresponding path program 3 times [2020-12-23 16:36:45,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:45,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205967469] [2020-12-23 16:36:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:45,732 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:45,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827743718] [2020-12-23 16:36:45,732 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 [2020-12-23 16:36:46,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:36:46,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:46,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:36:46,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2020-12-23 16:36:46,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205967469] [2020-12-23 16:36:46,737 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:46,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827743718] [2020-12-23 16:36:46,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:36:46,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:36:46,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484399526] [2020-12-23 16:36:46,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:36:46,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:36:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:36:46,740 INFO L87 Difference]: Start difference. First operand 752 states and 904 transitions. Second operand 3 states. [2020-12-23 16:36:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:46,869 INFO L93 Difference]: Finished difference Result 1376 states and 1653 transitions. [2020-12-23 16:36:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:36:46,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2020-12-23 16:36:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:46,876 INFO L225 Difference]: With dead ends: 1376 [2020-12-23 16:36:46,876 INFO L226 Difference]: Without dead ends: 1027 [2020-12-23 16:36:46,878 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 [2020-12-23 16:36:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-12-23 16:36:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2020-12-23 16:36:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2020-12-23 16:36:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1222 transitions. [2020-12-23 16:36:46,918 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1222 transitions. Word has length 370 [2020-12-23 16:36:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:46,919 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1222 transitions. [2020-12-23 16:36:46,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:36:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1222 transitions. [2020-12-23 16:36:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2020-12-23 16:36:46,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:46,924 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] [2020-12-23 16:36:47,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 16:36:47,138 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]=== [2020-12-23 16:36:47,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:47,138 INFO L82 PathProgramCache]: Analyzing trace with hash -145231630, now seen corresponding path program 1 times [2020-12-23 16:36:47,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:47,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753689789] [2020-12-23 16:36:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:47,182 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:47,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776211711] [2020-12-23 16:36:47,183 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 [2020-12-23 16:36:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:36:47,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:36:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-12-23 16:36:48,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753689789] [2020-12-23 16:36:48,241 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:48,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776211711] [2020-12-23 16:36:48,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:48,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 16:36:48,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801132418] [2020-12-23 16:36:48,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 16:36:48,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 16:36:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:36:48,243 INFO L87 Difference]: Start difference. First operand 1015 states and 1222 transitions. Second operand 8 states. [2020-12-23 16:36:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:48,380 INFO L93 Difference]: Finished difference Result 1989 states and 2411 transitions. [2020-12-23 16:36:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:36:48,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2020-12-23 16:36:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:48,386 INFO L225 Difference]: With dead ends: 1989 [2020-12-23 16:36:48,386 INFO L226 Difference]: Without dead ends: 1029 [2020-12-23 16:36:48,388 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 [2020-12-23 16:36:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2020-12-23 16:36:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2020-12-23 16:36:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2020-12-23 16:36:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1236 transitions. [2020-12-23 16:36:48,426 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1236 transitions. Word has length 377 [2020-12-23 16:36:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:48,426 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1236 transitions. [2020-12-23 16:36:48,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 16:36:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1236 transitions. [2020-12-23 16:36:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2020-12-23 16:36:48,430 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:48,431 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] [2020-12-23 16:36:48,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:48,646 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]=== [2020-12-23 16:36:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1700907916, now seen corresponding path program 2 times [2020-12-23 16:36:48,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:48,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093092395] [2020-12-23 16:36:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:48,681 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:48,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139891491] [2020-12-23 16:36:48,681 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 [2020-12-23 16:36:49,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:36:49,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:36:49,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:36:49,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:36:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 73 proven. 21 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2020-12-23 16:36:49,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093092395] [2020-12-23 16:36:49,939 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:36:49,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139891491] [2020-12-23 16:36:49,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:36:49,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 16:36:49,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217318880] [2020-12-23 16:36:49,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 16:36:49,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:36:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 16:36:49,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:36:49,942 INFO L87 Difference]: Start difference. First operand 1029 states and 1236 transitions. Second operand 9 states. [2020-12-23 16:36:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:36:50,099 INFO L93 Difference]: Finished difference Result 2016 states and 2438 transitions. [2020-12-23 16:36:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 16:36:50,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2020-12-23 16:36:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:36:50,105 INFO L225 Difference]: With dead ends: 2016 [2020-12-23 16:36:50,105 INFO L226 Difference]: Without dead ends: 1043 [2020-12-23 16:36:50,107 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 [2020-12-23 16:36:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2020-12-23 16:36:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2020-12-23 16:36:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2020-12-23 16:36:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1250 transitions. [2020-12-23 16:36:50,152 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1250 transitions. Word has length 381 [2020-12-23 16:36:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:36:50,152 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1250 transitions. [2020-12-23 16:36:50,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 16:36:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1250 transitions. [2020-12-23 16:36:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2020-12-23 16:36:50,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:36:50,157 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] [2020-12-23 16:36:50,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:36:50,371 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]=== [2020-12-23 16:36:50,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:36:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash -336611150, now seen corresponding path program 3 times [2020-12-23 16:36:50,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:36:50,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490543057] [2020-12-23 16:36:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:36:50,402 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:36:50,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113456952] [2020-12-23 16:36:50,403 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