/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_BER_test10-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:53:44,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:53:44,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:53:44,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:53:44,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:53:44,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:53:44,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:53:44,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:53:44,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:53:44,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:53:44,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:53:44,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:53:44,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:53:44,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:53:44,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:53:44,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:53:44,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:53:44,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:53:44,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:53:44,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:53:44,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:53:44,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:53:44,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:53:44,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:53:44,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:53:44,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:53:44,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:53:44,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:53:44,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:53:44,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:53:44,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:53:44,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:53:44,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:53:44,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:53:44,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:53:44,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:53:44,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:53:44,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:53:44,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:53:44,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:53:44,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:53:44,471 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 15:53:44,517 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:53:44,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:53:44,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:53:44,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:53:44,523 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:53:44,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:53:44,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:53:44,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:53:44,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:53:44,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:53:44,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:53:44,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:53:44,526 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:53:44,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:53:44,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:53:44,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:53:44,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:53:44,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:53:44,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:53:44,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:53:44,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:53:44,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:53:44,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:53:44,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:53:44,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:53:44,528 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 15:53:44,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:53:44,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:53:44,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:53:44,983 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:53:44,983 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:53:44,984 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_BER_test10-3.i [2020-12-23 15:53:45,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0df509f35/1beb7210ca9c4c5da6eb0c7395b07f46/FLAG05e465da5 [2020-12-23 15:53:45,873 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:53:45,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2020-12-23 15:53:45,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0df509f35/1beb7210ca9c4c5da6eb0c7395b07f46/FLAG05e465da5 [2020-12-23 15:53:46,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0df509f35/1beb7210ca9c4c5da6eb0c7395b07f46 [2020-12-23 15:53:46,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:53:46,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:53:46,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:53:46,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:53:46,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:53:46,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:53:46" (1/1) ... [2020-12-23 15:53:46,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b050d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:46, skipping insertion in model container [2020-12-23 15:53:46,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:53:46" (1/1) ... [2020-12-23 15:53:46,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:53:46,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 15:53:46,743 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_BER_test10-3.i[33022,33035] 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[~_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,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem449,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem449,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem454,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem454,],offset],IdentifierExpression[#t~mem456,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem460,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem460,],offset],IdentifierExpression[#t~mem462,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem474,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem474,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem477,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem477,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem490,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem490,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem495,],offset],IdentifierExpression[#t~mem497,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem501,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem501,],offset],IdentifierExpression[#t~mem503,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem515,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem515,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem518,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem518,],offset]]]] [2020-12-23 15:53:46,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:53:47,013 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 15:53:47,088 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_BER_test10-3.i[33022,33035] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem47,],base],StructAccessExpression[IdentifierExpression[#t~mem47,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem49,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem49,],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~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem62,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem63,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem63,],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~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem75,],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~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem99,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem99,],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~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem126,],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~mem134,],base],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem146,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem146,],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~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem177,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem178,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem178,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem181,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem181,],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~mem194,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem194,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem195,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem195,],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~mem207,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem207,],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~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem231,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem231,],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~mem258,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem258,],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~mem266,],base],StructAccessExpression[IdentifierExpression[#t~mem266,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem268,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem268,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem278,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem278,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~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,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem467,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem467,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem472,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem472,],offset],IdentifierExpression[#t~mem474,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem478,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem478,],offset],IdentifierExpression[#t~mem480,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem492,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem492,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem495,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem508,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem508,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem513,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem513,],offset],IdentifierExpression[#t~mem515,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem519,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem519,],offset],IdentifierExpression[#t~mem521,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem533,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem533,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem536,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem536,],offset]]]] [2020-12-23 15:53:47,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:53:47,552 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:53:47,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47 WrapperNode [2020-12-23 15:53:47,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:53:47,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:53:47,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:53:47,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:53:47,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:53:47,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:53:47,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:53:47,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:53:47,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:47,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:48,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (1/1) ... [2020-12-23 15:53:48,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:53:48,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:53:48,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:53:48,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:53:48,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (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 15:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 15:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:53:48,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:53:51,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:53:51,924 INFO L299 CfgBuilder]: Removed 224 assume(true) statements. [2020-12-23 15:53:51,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:53:51 BoogieIcfgContainer [2020-12-23 15:53:51,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:53:51,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:53:51,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:53:51,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:53:51,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:53:46" (1/3) ... [2020-12-23 15:53:51,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45399647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:53:51, skipping insertion in model container [2020-12-23 15:53:51,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:53:47" (2/3) ... [2020-12-23 15:53:51,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45399647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:53:51, skipping insertion in model container [2020-12-23 15:53:51,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:53:51" (3/3) ... [2020-12-23 15:53:51,936 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2020-12-23 15:53:51,944 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:53:51,950 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-12-23 15:53:51,970 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-12-23 15:53:52,002 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:53:52,003 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:53:52,003 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:53:52,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:53:52,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:53:52,004 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:53:52,004 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:53:52,004 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:53:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states. [2020-12-23 15:53:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 15:53:52,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:52,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:52,042 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:52,048 INFO L82 PathProgramCache]: Analyzing trace with hash -128377380, now seen corresponding path program 1 times [2020-12-23 15:53:52,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:52,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654864743] [2020-12-23 15:53:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:52,245 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 15:53:52,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654864743] [2020-12-23 15:53:52,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:52,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 15:53:52,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128816468] [2020-12-23 15:53:52,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 15:53:52,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 15:53:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 15:53:52,273 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 2 states. [2020-12-23 15:53:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:52,346 INFO L93 Difference]: Finished difference Result 1038 states and 1752 transitions. [2020-12-23 15:53:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 15:53:52,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-12-23 15:53:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:52,366 INFO L225 Difference]: With dead ends: 1038 [2020-12-23 15:53:52,367 INFO L226 Difference]: Without dead ends: 465 [2020-12-23 15:53:52,374 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 15:53:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-12-23 15:53:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2020-12-23 15:53:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-12-23 15:53:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 608 transitions. [2020-12-23 15:53:52,485 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 608 transitions. Word has length 9 [2020-12-23 15:53:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:52,486 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 608 transitions. [2020-12-23 15:53:52,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 15:53:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 608 transitions. [2020-12-23 15:53:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 15:53:52,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:52,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:52,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:53:52,490 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1568739198, now seen corresponding path program 1 times [2020-12-23 15:53:52,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:52,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111251899] [2020-12-23 15:53:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:52,604 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 15:53:52,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111251899] [2020-12-23 15:53:52,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:52,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:53:52,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169732800] [2020-12-23 15:53:52,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:53:52,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:53:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:53:52,608 INFO L87 Difference]: Start difference. First operand 465 states and 608 transitions. Second operand 4 states. [2020-12-23 15:53:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:53,546 INFO L93 Difference]: Finished difference Result 831 states and 1087 transitions. [2020-12-23 15:53:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:53:53,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 15:53:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:53,554 INFO L225 Difference]: With dead ends: 831 [2020-12-23 15:53:53,555 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 15:53:53,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:53:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 15:53:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 467. [2020-12-23 15:53:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-12-23 15:53:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 610 transitions. [2020-12-23 15:53:53,592 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 610 transitions. Word has length 44 [2020-12-23 15:53:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:53,592 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 610 transitions. [2020-12-23 15:53:53,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:53:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 610 transitions. [2020-12-23 15:53:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 15:53:53,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:53,600 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:53,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:53:53,601 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1325558428, now seen corresponding path program 1 times [2020-12-23 15:53:53,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:53,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357503545] [2020-12-23 15:53:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:53,666 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:53,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884812510] [2020-12-23 15:53:53,669 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 15:53:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:54,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:53:54,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:53:54,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357503545] [2020-12-23 15:53:54,246 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:54,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884812510] [2020-12-23 15:53:54,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:54,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:53:54,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962469918] [2020-12-23 15:53:54,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:53:54,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:53:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:53:54,249 INFO L87 Difference]: Start difference. First operand 467 states and 610 transitions. Second operand 3 states. [2020-12-23 15:53:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:54,386 INFO L93 Difference]: Finished difference Result 951 states and 1247 transitions. [2020-12-23 15:53:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:53:54,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 15:53:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:54,390 INFO L225 Difference]: With dead ends: 951 [2020-12-23 15:53:54,390 INFO L226 Difference]: Without dead ends: 488 [2020-12-23 15:53:54,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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 15:53:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-23 15:53:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2020-12-23 15:53:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-23 15:53:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2020-12-23 15:53:54,406 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 97 [2020-12-23 15:53:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:54,406 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2020-12-23 15:53:54,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:53:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2020-12-23 15:53:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 15:53:54,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:54,411 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:54,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 15:53:54,626 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 948433376, now seen corresponding path program 1 times [2020-12-23 15:53:54,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:54,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582060111] [2020-12-23 15:53:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:54,685 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:54,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320369093] [2020-12-23 15:53:54,686 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 15:53:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:55,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:53:55,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:53:55,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582060111] [2020-12-23 15:53:55,216 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:55,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320369093] [2020-12-23 15:53:55,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:55,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:53:55,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831791180] [2020-12-23 15:53:55,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:53:55,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:53:55,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:53:55,219 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand 3 states. [2020-12-23 15:53:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:55,312 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2020-12-23 15:53:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:53:55,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 15:53:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:55,316 INFO L225 Difference]: With dead ends: 787 [2020-12-23 15:53:55,316 INFO L226 Difference]: Without dead ends: 508 [2020-12-23 15:53:55,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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 15:53:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-12-23 15:53:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2020-12-23 15:53:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 15:53:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 650 transitions. [2020-12-23 15:53:55,330 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 650 transitions. Word has length 97 [2020-12-23 15:53:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:55,331 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 650 transitions. [2020-12-23 15:53:55,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:53:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 650 transitions. [2020-12-23 15:53:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 15:53:55,332 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:55,333 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:55,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:53:55,539 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389214, now seen corresponding path program 1 times [2020-12-23 15:53:55,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:55,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524924110] [2020-12-23 15:53:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:55,570 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:55,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803911420] [2020-12-23 15:53:55,571 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 15:53:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:53:55,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:53:56,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524924110] [2020-12-23 15:53:56,070 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:56,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803911420] [2020-12-23 15:53:56,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:56,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:53:56,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460473016] [2020-12-23 15:53:56,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:53:56,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:53:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:53:56,074 INFO L87 Difference]: Start difference. First operand 507 states and 650 transitions. Second operand 4 states. [2020-12-23 15:53:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:56,186 INFO L93 Difference]: Finished difference Result 1086 states and 1400 transitions. [2020-12-23 15:53:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:53:56,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 15:53:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:56,194 INFO L225 Difference]: With dead ends: 1086 [2020-12-23 15:53:56,194 INFO L226 Difference]: Without dead ends: 583 [2020-12-23 15:53:56,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 15:53:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-23 15:53:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 493. [2020-12-23 15:53:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 15:53:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 629 transitions. [2020-12-23 15:53:56,208 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 629 transitions. Word has length 97 [2020-12-23 15:53:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:56,209 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 629 transitions. [2020-12-23 15:53:56,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:53:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 629 transitions. [2020-12-23 15:53:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 15:53:56,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:56,210 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:56,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:53:56,426 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:56,427 INFO L82 PathProgramCache]: Analyzing trace with hash 881478960, now seen corresponding path program 1 times [2020-12-23 15:53:56,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:56,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064773981] [2020-12-23 15:53:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:56,466 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:56,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784985915] [2020-12-23 15:53:56,467 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 15:53:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:56,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:53:56,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 15:53:57,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064773981] [2020-12-23 15:53:57,037 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:57,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784985915] [2020-12-23 15:53:57,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:57,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:53:57,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831081244] [2020-12-23 15:53:57,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:53:57,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:53:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:53:57,040 INFO L87 Difference]: Start difference. First operand 493 states and 629 transitions. Second operand 4 states. [2020-12-23 15:53:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:57,186 INFO L93 Difference]: Finished difference Result 761 states and 972 transitions. [2020-12-23 15:53:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:53:57,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 15:53:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:57,190 INFO L225 Difference]: With dead ends: 761 [2020-12-23 15:53:57,190 INFO L226 Difference]: Without dead ends: 480 [2020-12-23 15:53:57,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 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 15:53:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-23 15:53:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2020-12-23 15:53:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-12-23 15:53:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 608 transitions. [2020-12-23 15:53:57,205 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 608 transitions. Word has length 97 [2020-12-23 15:53:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:57,205 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 608 transitions. [2020-12-23 15:53:57,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:53:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 608 transitions. [2020-12-23 15:53:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 15:53:57,207 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:57,207 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:53:57,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:53:57,422 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1427704734, now seen corresponding path program 1 times [2020-12-23 15:53:57,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:57,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798436234] [2020-12-23 15:53:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:57,445 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:57,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507701729] [2020-12-23 15:53:57,446 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 15:53:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:57,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:53:57,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:53:57,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798436234] [2020-12-23 15:53:57,909 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:57,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507701729] [2020-12-23 15:53:57,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:57,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:53:57,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025800193] [2020-12-23 15:53:57,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:53:57,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:53:57,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:53:57,912 INFO L87 Difference]: Start difference. First operand 479 states and 608 transitions. Second operand 3 states. [2020-12-23 15:53:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:58,016 INFO L93 Difference]: Finished difference Result 1231 states and 1562 transitions. [2020-12-23 15:53:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:53:58,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 15:53:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:58,021 INFO L225 Difference]: With dead ends: 1231 [2020-12-23 15:53:58,021 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 15:53:58,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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 15:53:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 15:53:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 721. [2020-12-23 15:53:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2020-12-23 15:53:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2020-12-23 15:53:58,043 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 97 [2020-12-23 15:53:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:58,043 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2020-12-23 15:53:58,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:53:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2020-12-23 15:53:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 15:53:58,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:58,045 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:53:58,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 15:53:58,261 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -371205377, now seen corresponding path program 1 times [2020-12-23 15:53:58,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:58,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170281900] [2020-12-23 15:53:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:58,281 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:58,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799467847] [2020-12-23 15:53:58,282 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 15:53:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:58,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:53:58,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:53:58,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170281900] [2020-12-23 15:53:58,766 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:58,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799467847] [2020-12-23 15:53:58,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:53:58,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:53:58,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156019125] [2020-12-23 15:53:58,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:53:58,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:53:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:53:58,768 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 3 states. [2020-12-23 15:53:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:58,828 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2020-12-23 15:53:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:53:58,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 15:53:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:58,833 INFO L225 Difference]: With dead ends: 1400 [2020-12-23 15:53:58,834 INFO L226 Difference]: Without dead ends: 727 [2020-12-23 15:53:58,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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 15:53:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2020-12-23 15:53:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2020-12-23 15:53:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-12-23 15:53:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 936 transitions. [2020-12-23 15:53:58,856 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 936 transitions. Word has length 104 [2020-12-23 15:53:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:58,857 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 936 transitions. [2020-12-23 15:53:58,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:53:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 936 transitions. [2020-12-23 15:53:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 15:53:58,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:58,859 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:53:59,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:53:59,073 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2085853600, now seen corresponding path program 1 times [2020-12-23 15:53:59,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:59,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128249936] [2020-12-23 15:53:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:59,097 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:59,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113402368] [2020-12-23 15:53:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:53:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:53:59,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:53:59,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:53:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 15:53:59,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128249936] [2020-12-23 15:53:59,595 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:53:59,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113402368] [2020-12-23 15:53:59,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:53:59,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 15:53:59,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388005220] [2020-12-23 15:53:59,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:53:59,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:53:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:53:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:53:59,598 INFO L87 Difference]: Start difference. First operand 727 states and 936 transitions. Second operand 4 states. [2020-12-23 15:53:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:53:59,685 INFO L93 Difference]: Finished difference Result 1411 states and 1820 transitions. [2020-12-23 15:53:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:53:59,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 15:53:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:53:59,689 INFO L225 Difference]: With dead ends: 1411 [2020-12-23 15:53:59,690 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 15:53:59,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:53:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 15:53:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 15:53:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 15:53:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 942 transitions. [2020-12-23 15:53:59,710 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 942 transitions. Word has length 106 [2020-12-23 15:53:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:53:59,710 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 942 transitions. [2020-12-23 15:53:59,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:53:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 942 transitions. [2020-12-23 15:53:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 15:53:59,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:53:59,712 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:53:59,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:53:59,926 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:53:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:53:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -462744993, now seen corresponding path program 2 times [2020-12-23 15:53:59,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:53:59,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436099706] [2020-12-23 15:53:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:53:59,945 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:53:59,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866657217] [2020-12-23 15:53:59,946 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 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 15:54:01,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:54:01,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:01,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:54:01,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:54:01,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436099706] [2020-12-23 15:54:01,260 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:01,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866657217] [2020-12-23 15:54:01,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:01,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 15:54:01,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208208483] [2020-12-23 15:54:01,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:54:01,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:54:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:54:01,263 INFO L87 Difference]: Start difference. First operand 733 states and 942 transitions. Second operand 5 states. [2020-12-23 15:54:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:01,371 INFO L93 Difference]: Finished difference Result 1422 states and 1831 transitions. [2020-12-23 15:54:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:54:01,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-12-23 15:54:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:01,375 INFO L225 Difference]: With dead ends: 1422 [2020-12-23 15:54:01,375 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 15:54:01,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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 15:54:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 15:54:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 15:54:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 15:54:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2020-12-23 15:54:01,396 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 108 [2020-12-23 15:54:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:01,397 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2020-12-23 15:54:01,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:54:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2020-12-23 15:54:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 15:54:01,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:01,398 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:54:01,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 15:54:01,604 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 87417216, now seen corresponding path program 3 times [2020-12-23 15:54:01,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:01,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800795670] [2020-12-23 15:54:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:01,621 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:01,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999997622] [2020-12-23 15:54:01,621 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 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 15:54:02,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:54:02,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:02,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 15:54:02,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:02,452 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 15:54:02,453 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:54:02,463 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 15:54:02,463 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:54:02,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2020-12-23 15:54:02,494 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:54:02,494 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 15:54:02,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 15:54:02,507 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,512 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:54:02,513 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-12-23 15:54:02,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 15:54:02,600 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 15:54:02,601 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 15:54:02,609 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 15:54:02,609 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:3 [2020-12-23 15:54:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:54:02,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800795670] [2020-12-23 15:54:02,680 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:02,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999997622] [2020-12-23 15:54:02,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:02,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:54:02,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458988987] [2020-12-23 15:54:02,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:54:02,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:54:02,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:54:02,682 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 5 states. [2020-12-23 15:54:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:03,619 INFO L93 Difference]: Finished difference Result 1382 states and 1772 transitions. [2020-12-23 15:54:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:54:03,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-12-23 15:54:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:03,623 INFO L225 Difference]: With dead ends: 1382 [2020-12-23 15:54:03,623 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 15:54:03,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:54:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 15:54:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 15:54:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 15:54:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2020-12-23 15:54:03,645 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 110 [2020-12-23 15:54:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:03,646 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2020-12-23 15:54:03,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:54:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2020-12-23 15:54:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:54:03,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:03,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:03,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:03,861 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2117457625, now seen corresponding path program 1 times [2020-12-23 15:54:03,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:03,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813069550] [2020-12-23 15:54:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:03,890 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:03,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454230429] [2020-12-23 15:54:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:04,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:54:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:54:04,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813069550] [2020-12-23 15:54:04,490 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:04,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454230429] [2020-12-23 15:54:04,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:04,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:54:04,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059584438] [2020-12-23 15:54:04,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:54:04,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:04,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:54:04,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:54:04,492 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 3 states. [2020-12-23 15:54:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:04,605 INFO L93 Difference]: Finished difference Result 1502 states and 1935 transitions. [2020-12-23 15:54:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:54:04,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 15:54:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:04,609 INFO L225 Difference]: With dead ends: 1502 [2020-12-23 15:54:04,610 INFO L226 Difference]: Without dead ends: 781 [2020-12-23 15:54:04,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 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 15:54:04,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-23 15:54:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2020-12-23 15:54:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-12-23 15:54:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 987 transitions. [2020-12-23 15:54:04,637 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 987 transitions. Word has length 157 [2020-12-23 15:54:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:04,637 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 987 transitions. [2020-12-23 15:54:04,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:54:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 987 transitions. [2020-12-23 15:54:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:54:04,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:04,640 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:04,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:04,855 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1572585051, now seen corresponding path program 1 times [2020-12-23 15:54:04,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:04,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532790795] [2020-12-23 15:54:04,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:04,878 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:04,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313809226] [2020-12-23 15:54:04,879 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 15:54:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:05,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 15:54:05,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:54:05,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532790795] [2020-12-23 15:54:05,431 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:05,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313809226] [2020-12-23 15:54:05,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:05,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:54:05,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090472435] [2020-12-23 15:54:05,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:54:05,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:54:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:54:05,433 INFO L87 Difference]: Start difference. First operand 779 states and 987 transitions. Second operand 4 states. [2020-12-23 15:54:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:05,542 INFO L93 Difference]: Finished difference Result 1496 states and 1900 transitions. [2020-12-23 15:54:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:54:05,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 15:54:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:05,546 INFO L225 Difference]: With dead ends: 1496 [2020-12-23 15:54:05,547 INFO L226 Difference]: Without dead ends: 753 [2020-12-23 15:54:05,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 15:54:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-12-23 15:54:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2020-12-23 15:54:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-12-23 15:54:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 945 transitions. [2020-12-23 15:54:05,570 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 945 transitions. Word has length 157 [2020-12-23 15:54:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:05,571 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 945 transitions. [2020-12-23 15:54:05,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:54:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 945 transitions. [2020-12-23 15:54:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:54:05,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:05,573 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:05,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:54:05,787 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 94293941, now seen corresponding path program 1 times [2020-12-23 15:54:05,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:05,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796878315] [2020-12-23 15:54:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:05,808 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:05,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758826291] [2020-12-23 15:54:05,808 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 15:54:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:06,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:54:06,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:54:06,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796878315] [2020-12-23 15:54:06,411 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:06,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758826291] [2020-12-23 15:54:06,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:06,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:54:06,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282255690] [2020-12-23 15:54:06,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:54:06,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:54:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:54:06,413 INFO L87 Difference]: Start difference. First operand 751 states and 945 transitions. Second operand 5 states. [2020-12-23 15:54:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:06,580 INFO L93 Difference]: Finished difference Result 2209 states and 2786 transitions. [2020-12-23 15:54:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:54:06,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-12-23 15:54:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:06,587 INFO L225 Difference]: With dead ends: 2209 [2020-12-23 15:54:06,588 INFO L226 Difference]: Without dead ends: 1496 [2020-12-23 15:54:06,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:54:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-12-23 15:54:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 797. [2020-12-23 15:54:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-12-23 15:54:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 995 transitions. [2020-12-23 15:54:06,621 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 995 transitions. Word has length 157 [2020-12-23 15:54:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:06,622 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 995 transitions. [2020-12-23 15:54:06,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:54:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 995 transitions. [2020-12-23 15:54:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:54:06,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:06,624 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:06,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 15:54:06,838 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:06,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1994860229, now seen corresponding path program 1 times [2020-12-23 15:54:06,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:06,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223782552] [2020-12-23 15:54:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:06,856 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:06,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052607843] [2020-12-23 15:54:06,857 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 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 15:54:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:07,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:54:07,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 15:54:07,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223782552] [2020-12-23 15:54:07,415 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:07,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052607843] [2020-12-23 15:54:07,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:07,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:54:07,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432968261] [2020-12-23 15:54:07,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:54:07,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:54:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:54:07,417 INFO L87 Difference]: Start difference. First operand 797 states and 995 transitions. Second operand 4 states. [2020-12-23 15:54:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:07,488 INFO L93 Difference]: Finished difference Result 1503 states and 1887 transitions. [2020-12-23 15:54:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:54:07,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 15:54:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:07,492 INFO L225 Difference]: With dead ends: 1503 [2020-12-23 15:54:07,492 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 15:54:07,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 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 15:54:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 15:54:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 15:54:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 15:54:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2020-12-23 15:54:07,518 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 157 [2020-12-23 15:54:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:07,519 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2020-12-23 15:54:07,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:54:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2020-12-23 15:54:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 15:54:07,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:07,521 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:07,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 15:54:07,735 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 639166515, now seen corresponding path program 1 times [2020-12-23 15:54:07,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:07,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128653662] [2020-12-23 15:54:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:07,754 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:07,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625809979] [2020-12-23 15:54:07,755 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 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 15:54:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:08,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 15:54:08,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 15:54:08,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128653662] [2020-12-23 15:54:08,375 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:08,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625809979] [2020-12-23 15:54:08,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:08,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 15:54:08,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260121100] [2020-12-23 15:54:08,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 15:54:08,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 15:54:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:54:08,377 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 6 states. [2020-12-23 15:54:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:08,470 INFO L93 Difference]: Finished difference Result 1424 states and 1796 transitions. [2020-12-23 15:54:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:54:08,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2020-12-23 15:54:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:08,474 INFO L225 Difference]: With dead ends: 1424 [2020-12-23 15:54:08,474 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 15:54:08,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 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 15:54:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 15:54:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 15:54:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 15:54:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 923 transitions. [2020-12-23 15:54:08,504 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 923 transitions. Word has length 157 [2020-12-23 15:54:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:08,504 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 923 transitions. [2020-12-23 15:54:08,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 15:54:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 923 transitions. [2020-12-23 15:54:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 15:54:08,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:08,506 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:08,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:08,720 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1050888114, now seen corresponding path program 2 times [2020-12-23 15:54:08,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:08,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642691449] [2020-12-23 15:54:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:08,739 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:08,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565812042] [2020-12-23 15:54:08,739 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 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 15:54:09,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:54:09,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:09,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 15:54:09,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 15:54:09,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642691449] [2020-12-23 15:54:09,424 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:09,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565812042] [2020-12-23 15:54:09,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:09,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 15:54:09,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114322926] [2020-12-23 15:54:09,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:54:09,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:09,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:54:09,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:54:09,426 INFO L87 Difference]: Start difference. First operand 739 states and 923 transitions. Second operand 7 states. [2020-12-23 15:54:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:09,547 INFO L93 Difference]: Finished difference Result 1435 states and 1807 transitions. [2020-12-23 15:54:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:54:09,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2020-12-23 15:54:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:09,552 INFO L225 Difference]: With dead ends: 1435 [2020-12-23 15:54:09,552 INFO L226 Difference]: Without dead ends: 745 [2020-12-23 15:54:09,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 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 15:54:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-23 15:54:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2020-12-23 15:54:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-12-23 15:54:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 929 transitions. [2020-12-23 15:54:09,583 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 929 transitions. Word has length 159 [2020-12-23 15:54:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:09,583 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 929 transitions. [2020-12-23 15:54:09,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:54:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 929 transitions. [2020-12-23 15:54:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 15:54:09,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:09,585 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:09,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 15:54:09,799 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash 770488787, now seen corresponding path program 3 times [2020-12-23 15:54:09,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:09,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206734843] [2020-12-23 15:54:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:09,817 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:09,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244454588] [2020-12-23 15:54:09,818 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 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 15:54:10,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:54:10,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:10,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 15:54:10,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 15:54:10,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206734843] [2020-12-23 15:54:10,600 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:10,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244454588] [2020-12-23 15:54:10,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:10,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:54:10,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702879213] [2020-12-23 15:54:10,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:54:10,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:54:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:54:10,605 INFO L87 Difference]: Start difference. First operand 745 states and 929 transitions. Second operand 3 states. [2020-12-23 15:54:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:10,745 INFO L93 Difference]: Finished difference Result 1749 states and 2217 transitions. [2020-12-23 15:54:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:54:10,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2020-12-23 15:54:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:10,751 INFO L225 Difference]: With dead ends: 1749 [2020-12-23 15:54:10,752 INFO L226 Difference]: Without dead ends: 1063 [2020-12-23 15:54:10,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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 15:54:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-12-23 15:54:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 906. [2020-12-23 15:54:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-23 15:54:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1156 transitions. [2020-12-23 15:54:10,800 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1156 transitions. Word has length 161 [2020-12-23 15:54:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:10,800 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1156 transitions. [2020-12-23 15:54:10,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:54:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1156 transitions. [2020-12-23 15:54:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 15:54:10,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:10,803 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:11,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 15:54:11,009 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1484056676, now seen corresponding path program 1 times [2020-12-23 15:54:11,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:11,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346303943] [2020-12-23 15:54:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:11,032 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:11,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517742549] [2020-12-23 15:54:11,032 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 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 15:54:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:11,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 15:54:11,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 15:54:11,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346303943] [2020-12-23 15:54:11,702 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:11,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517742549] [2020-12-23 15:54:11,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:11,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 15:54:11,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193657276] [2020-12-23 15:54:11,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:54:11,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:54:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:54:11,704 INFO L87 Difference]: Start difference. First operand 906 states and 1156 transitions. Second operand 8 states. [2020-12-23 15:54:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:11,840 INFO L93 Difference]: Finished difference Result 1770 states and 2275 transitions. [2020-12-23 15:54:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 15:54:11,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2020-12-23 15:54:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:11,846 INFO L225 Difference]: With dead ends: 1770 [2020-12-23 15:54:11,846 INFO L226 Difference]: Without dead ends: 912 [2020-12-23 15:54:11,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 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 15:54:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2020-12-23 15:54:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2020-12-23 15:54:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2020-12-23 15:54:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1162 transitions. [2020-12-23 15:54:11,883 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1162 transitions. Word has length 178 [2020-12-23 15:54:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:11,883 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1162 transitions. [2020-12-23 15:54:11,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:54:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1162 transitions. [2020-12-23 15:54:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 15:54:11,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:11,886 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:12,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:12,102 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash -453644734, now seen corresponding path program 2 times [2020-12-23 15:54:12,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:12,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239681496] [2020-12-23 15:54:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:12,120 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:12,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195042702] [2020-12-23 15:54:12,121 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 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 15:54:12,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:54:12,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:12,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:54:12,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-12-23 15:54:12,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239681496] [2020-12-23 15:54:12,919 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:12,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195042702] [2020-12-23 15:54:12,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:12,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 15:54:12,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051210156] [2020-12-23 15:54:12,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:54:12,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:54:12,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:54:12,921 INFO L87 Difference]: Start difference. First operand 912 states and 1162 transitions. Second operand 9 states. [2020-12-23 15:54:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:13,063 INFO L93 Difference]: Finished difference Result 1781 states and 2286 transitions. [2020-12-23 15:54:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 15:54:13,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2020-12-23 15:54:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:13,070 INFO L225 Difference]: With dead ends: 1781 [2020-12-23 15:54:13,070 INFO L226 Difference]: Without dead ends: 918 [2020-12-23 15:54:13,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 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 15:54:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2020-12-23 15:54:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2020-12-23 15:54:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2020-12-23 15:54:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1168 transitions. [2020-12-23 15:54:13,109 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1168 transitions. Word has length 182 [2020-12-23 15:54:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:13,110 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1168 transitions. [2020-12-23 15:54:13,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:54:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1168 transitions. [2020-12-23 15:54:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 15:54:13,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:13,113 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:13,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:13,327 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1986963428, now seen corresponding path program 3 times [2020-12-23 15:54:13,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:13,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977580540] [2020-12-23 15:54:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:13,356 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:13,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746532307] [2020-12-23 15:54:13,357 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 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 15:54:13,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 15:54:13,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:13,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 15:54:13,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-12-23 15:54:14,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977580540] [2020-12-23 15:54:14,204 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:14,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746532307] [2020-12-23 15:54:14,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:54:14,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:54:14,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873652226] [2020-12-23 15:54:14,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:54:14,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:14,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:54:14,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:54:14,206 INFO L87 Difference]: Start difference. First operand 918 states and 1168 transitions. Second operand 4 states. [2020-12-23 15:54:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:14,821 INFO L93 Difference]: Finished difference Result 1509 states and 1921 transitions. [2020-12-23 15:54:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:54:14,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-12-23 15:54:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:14,826 INFO L225 Difference]: With dead ends: 1509 [2020-12-23 15:54:14,826 INFO L226 Difference]: Without dead ends: 732 [2020-12-23 15:54:14,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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 15:54:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-23 15:54:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-12-23 15:54:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-23 15:54:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2020-12-23 15:54:14,858 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 186 [2020-12-23 15:54:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:14,858 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2020-12-23 15:54:14,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:54:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2020-12-23 15:54:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 15:54:14,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:14,861 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:15,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:15,076 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:15,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1622468887, now seen corresponding path program 1 times [2020-12-23 15:54:15,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:15,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570760526] [2020-12-23 15:54:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:15,098 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:15,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637376684] [2020-12-23 15:54:15,098 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 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 [2020-12-23 15:54:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:54:15,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 15:54:15,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-23 15:54:15,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570760526] [2020-12-23 15:54:15,858 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:15,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637376684] [2020-12-23 15:54:15,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:15,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-12-23 15:54:15,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288908416] [2020-12-23 15:54:15,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:54:15,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:15,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:54:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:54:15,860 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 10 states. [2020-12-23 15:54:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:16,047 INFO L93 Difference]: Finished difference Result 1418 states and 1775 transitions. [2020-12-23 15:54:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 15:54:16,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2020-12-23 15:54:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:16,053 INFO L225 Difference]: With dead ends: 1418 [2020-12-23 15:54:16,053 INFO L226 Difference]: Without dead ends: 736 [2020-12-23 15:54:16,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:54:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-23 15:54:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2020-12-23 15:54:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-12-23 15:54:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 913 transitions. [2020-12-23 15:54:16,083 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 913 transitions. Word has length 193 [2020-12-23 15:54:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:16,083 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 913 transitions. [2020-12-23 15:54:16,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:54:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 913 transitions. [2020-12-23 15:54:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-23 15:54:16,086 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:16,086 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:16,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 15:54:16,300 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1336921525, now seen corresponding path program 2 times [2020-12-23 15:54:16,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:16,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547947566] [2020-12-23 15:54:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:16,319 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:16,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891532465] [2020-12-23 15:54:16,320 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:54:17,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:54:17,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:54:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 15:54:17,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:54:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-12-23 15:54:17,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547947566] [2020-12-23 15:54:17,354 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 15:54:17,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891532465] [2020-12-23 15:54:17,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 15:54:17,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-12-23 15:54:17,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856502420] [2020-12-23 15:54:17,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 15:54:17,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:54:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 15:54:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:54:17,356 INFO L87 Difference]: Start difference. First operand 736 states and 913 transitions. Second operand 11 states. [2020-12-23 15:54:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:54:17,532 INFO L93 Difference]: Finished difference Result 1425 states and 1782 transitions. [2020-12-23 15:54:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 15:54:17,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2020-12-23 15:54:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:54:17,537 INFO L225 Difference]: With dead ends: 1425 [2020-12-23 15:54:17,537 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 15:54:17,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:54:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 15:54:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 15:54:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 15:54:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2020-12-23 15:54:17,570 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 197 [2020-12-23 15:54:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:54:17,571 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2020-12-23 15:54:17,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 15:54:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2020-12-23 15:54:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-23 15:54:17,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:54:17,573 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:17,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 15:54:17,779 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:54:17,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:54:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1628837737, now seen corresponding path program 3 times [2020-12-23 15:54:17,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:54:17,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109712064] [2020-12-23 15:54:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:54:17,803 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 15:54:17,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638887374] [2020-12-23 15:54:17,804 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true