/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:30:15,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:30:15,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:30:15,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:30:15,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:30:15,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:30:15,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:30:15,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:30:15,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:30:15,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:30:15,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:30:15,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:30:15,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:30:15,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:30:15,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:30:15,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:30:15,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:30:15,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:30:15,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:30:15,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:30:15,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:30:15,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:30:15,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:30:15,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:30:15,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:30:15,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:30:15,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:30:15,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:30:15,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:30:15,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:30:15,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:30:15,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:30:15,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:30:15,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:30:15,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:30:15,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:30:15,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:30:15,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:30:15,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:30:15,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:30:15,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:30:15,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 04:30:15,840 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:30:15,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:30:15,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:30:15,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:30:15,846 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:30:15,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:30:15,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:30:15,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:30:15,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:30:15,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:30:15,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:30:15,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:30:15,848 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:30:15,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:30:15,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:30:15,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:30:15,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:30:15,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:30:15,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:30:15,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:30:15,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:30:15,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:30:15,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:30:15,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:30:15,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:30:15,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 04:30:16,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:30:16,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:30:16,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:30:16,361 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:30:16,362 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:30:16,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2021-01-07 04:30:16,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/647439a13/25a5f68685e6463ca6039f46f4b6df04/FLAG6feb58b5d [2021-01-07 04:30:17,254 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:30:17,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2021-01-07 04:30:17,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/647439a13/25a5f68685e6463ca6039f46f4b6df04/FLAG6feb58b5d [2021-01-07 04:30:17,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/647439a13/25a5f68685e6463ca6039f46f4b6df04 [2021-01-07 04:30:17,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:30:17,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:30:17,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:17,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:30:17,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:30:17,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:17" (1/1) ... [2021-01-07 04:30:17,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58aa6d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:17, skipping insertion in model container [2021-01-07 04:30:17,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:30:17" (1/1) ... [2021-01-07 04:30:17,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:30:17,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:30:18,151 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:30:18,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:18,388 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:30:18,424 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:30:18,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:30:18,623 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:30:18,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18 WrapperNode [2021-01-07 04:30:18,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:30:18,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:18,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:30:18,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:30:18,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:30:18,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:30:18,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:30:18,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:30:18,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:18,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... [2021-01-07 04:30:19,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:30:19,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:30:19,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:30:19,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:30:19,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:30:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:30:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:30:19,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:30:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:30:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:30:21,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:30:21,377 INFO L299 CfgBuilder]: Removed 98 assume(true) statements. [2021-01-07 04:30:21,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:21 BoogieIcfgContainer [2021-01-07 04:30:21,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:30:21,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:30:21,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:30:21,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:30:21,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:30:17" (1/3) ... [2021-01-07 04:30:21,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ea986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:21, skipping insertion in model container [2021-01-07 04:30:21,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:30:18" (2/3) ... [2021-01-07 04:30:21,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ea986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:30:21, skipping insertion in model container [2021-01-07 04:30:21,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:30:21" (3/3) ... [2021-01-07 04:30:21,389 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2021-01-07 04:30:21,396 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:30:21,403 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2021-01-07 04:30:21,425 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-07 04:30:21,460 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:30:21,460 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:30:21,461 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:30:21,461 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:30:21,461 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:30:21,461 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:30:21,461 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:30:21,461 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:30:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2021-01-07 04:30:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:30:21,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:21,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:21,494 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2021-01-07 04:30:21,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:21,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801138188] [2021-01-07 04:30:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:21,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801138188] [2021-01-07 04:30:21,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:21,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:30:21,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2361558] [2021-01-07 04:30:21,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:30:21,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:30:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:30:21,773 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2021-01-07 04:30:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:21,859 INFO L93 Difference]: Finished difference Result 440 states and 724 transitions. [2021-01-07 04:30:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:30:21,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:30:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:21,881 INFO L225 Difference]: With dead ends: 440 [2021-01-07 04:30:21,882 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 04:30:21,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:30:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 04:30:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-01-07 04:30:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-07 04:30:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2021-01-07 04:30:21,948 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2021-01-07 04:30:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:21,948 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2021-01-07 04:30:21,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:30:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2021-01-07 04:30:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:30:21,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:21,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:21,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:30:21,950 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2021-01-07 04:30:21,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:21,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364509007] [2021-01-07 04:30:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:22,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364509007] [2021-01-07 04:30:22,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:22,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:22,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132723733] [2021-01-07 04:30:22,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:22,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:22,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:22,060 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2021-01-07 04:30:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:22,140 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2021-01-07 04:30:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:22,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 04:30:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:22,146 INFO L225 Difference]: With dead ends: 432 [2021-01-07 04:30:22,146 INFO L226 Difference]: Without dead ends: 387 [2021-01-07 04:30:22,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-07 04:30:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2021-01-07 04:30:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 04:30:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2021-01-07 04:30:22,183 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2021-01-07 04:30:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:22,185 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2021-01-07 04:30:22,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2021-01-07 04:30:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:22,195 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:22,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:22,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:30:22,196 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2021-01-07 04:30:22,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:22,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389474271] [2021-01-07 04:30:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:22,251 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:22,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022496004] [2021-01-07 04:30:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:22,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:22,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:22,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389474271] [2021-01-07 04:30:22,701 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:22,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022496004] [2021-01-07 04:30:22,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:22,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:22,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101586801] [2021-01-07 04:30:22,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:22,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:22,707 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2021-01-07 04:30:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:22,827 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-01-07 04:30:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:22,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:30:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:22,829 INFO L225 Difference]: With dead ends: 454 [2021-01-07 04:30:22,830 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 04:30:22,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 04:30:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2021-01-07 04:30:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 04:30:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2021-01-07 04:30:22,868 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2021-01-07 04:30:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:22,869 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2021-01-07 04:30:22,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2021-01-07 04:30:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:22,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:22,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:23,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:30:23,094 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:23,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2021-01-07 04:30:23,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:23,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350584940] [2021-01-07 04:30:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:23,121 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:23,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652600529] [2021-01-07 04:30:23,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:23,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:23,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:23,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350584940] [2021-01-07 04:30:23,448 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:23,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652600529] [2021-01-07 04:30:23,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:23,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:23,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186340223] [2021-01-07 04:30:23,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:23,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:23,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:23,451 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2021-01-07 04:30:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:23,532 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2021-01-07 04:30:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:23,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:30:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:23,535 INFO L225 Difference]: With dead ends: 494 [2021-01-07 04:30:23,535 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 04:30:23,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 04:30:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-01-07 04:30:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2021-01-07 04:30:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2021-01-07 04:30:23,567 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2021-01-07 04:30:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:23,570 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2021-01-07 04:30:23,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2021-01-07 04:30:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:23,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:23,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:23,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:23,782 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2021-01-07 04:30:23,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:23,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984720994] [2021-01-07 04:30:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:23,806 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:23,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093488294] [2021-01-07 04:30:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:24,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:24,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:24,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984720994] [2021-01-07 04:30:24,177 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:24,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093488294] [2021-01-07 04:30:24,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:24,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:24,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013332450] [2021-01-07 04:30:24,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:24,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:24,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:24,179 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2021-01-07 04:30:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:24,273 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2021-01-07 04:30:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:24,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:30:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:24,275 INFO L225 Difference]: With dead ends: 505 [2021-01-07 04:30:24,275 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 04:30:24,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 04:30:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2021-01-07 04:30:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-07 04:30:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2021-01-07 04:30:24,283 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2021-01-07 04:30:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:24,284 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2021-01-07 04:30:24,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2021-01-07 04:30:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:24,285 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:24,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:24,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:24,503 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2021-01-07 04:30:24,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:24,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585999965] [2021-01-07 04:30:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:24,525 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:24,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160326760] [2021-01-07 04:30:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:24,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:24,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:24,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585999965] [2021-01-07 04:30:24,888 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:24,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160326760] [2021-01-07 04:30:24,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:24,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:24,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752156951] [2021-01-07 04:30:24,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:24,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:24,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:24,891 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2021-01-07 04:30:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:24,984 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2021-01-07 04:30:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:24,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:30:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:24,987 INFO L225 Difference]: With dead ends: 566 [2021-01-07 04:30:24,987 INFO L226 Difference]: Without dead ends: 325 [2021-01-07 04:30:24,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-07 04:30:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2021-01-07 04:30:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 04:30:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2021-01-07 04:30:24,999 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2021-01-07 04:30:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:24,999 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2021-01-07 04:30:24,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2021-01-07 04:30:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:30:25,001 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:25,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:25,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:25,216 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:25,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:25,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2021-01-07 04:30:25,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:25,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740185648] [2021-01-07 04:30:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:25,240 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:25,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510373796] [2021-01-07 04:30:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:25,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:25,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:30:25,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740185648] [2021-01-07 04:30:25,581 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:25,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510373796] [2021-01-07 04:30:25,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:25,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:30:25,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263838097] [2021-01-07 04:30:25,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:25,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:25,583 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2021-01-07 04:30:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:25,625 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2021-01-07 04:30:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:25,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:30:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:25,630 INFO L225 Difference]: With dead ends: 638 [2021-01-07 04:30:25,630 INFO L226 Difference]: Without dead ends: 593 [2021-01-07 04:30:25,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-01-07 04:30:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2021-01-07 04:30:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-07 04:30:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2021-01-07 04:30:25,649 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2021-01-07 04:30:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:25,649 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2021-01-07 04:30:25,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2021-01-07 04:30:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-07 04:30:25,652 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:25,652 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:25,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:30:25,868 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2021-01-07 04:30:25,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:25,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626122629] [2021-01-07 04:30:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:25,919 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:25,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [761086374] [2021-01-07 04:30:25,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:26,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 04:30:26,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:26,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:30:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-07 04:30:26,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626122629] [2021-01-07 04:30:26,419 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:26,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761086374] [2021-01-07 04:30:26,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:26,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:30:26,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157938996] [2021-01-07 04:30:26,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:26,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:26,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:26,422 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2021-01-07 04:30:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:26,924 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2021-01-07 04:30:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:26,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2021-01-07 04:30:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:26,927 INFO L225 Difference]: With dead ends: 677 [2021-01-07 04:30:26,927 INFO L226 Difference]: Without dead ends: 410 [2021-01-07 04:30:26,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-01-07 04:30:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-01-07 04:30:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2021-01-07 04:30:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2021-01-07 04:30:26,944 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2021-01-07 04:30:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:26,944 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2021-01-07 04:30:26,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2021-01-07 04:30:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-07 04:30:26,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:26,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:27,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:27,164 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2021-01-07 04:30:27,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:27,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014921869] [2021-01-07 04:30:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:27,211 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:27,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997115454] [2021-01-07 04:30:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:27,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:30:27,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 04:30:27,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014921869] [2021-01-07 04:30:27,670 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:27,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997115454] [2021-01-07 04:30:27,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:27,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:27,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039366430] [2021-01-07 04:30:27,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:27,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:27,673 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2021-01-07 04:30:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:27,724 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2021-01-07 04:30:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:27,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2021-01-07 04:30:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:27,727 INFO L225 Difference]: With dead ends: 776 [2021-01-07 04:30:27,727 INFO L226 Difference]: Without dead ends: 418 [2021-01-07 04:30:27,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-07 04:30:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-01-07 04:30:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-07 04:30:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2021-01-07 04:30:27,743 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2021-01-07 04:30:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:27,744 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2021-01-07 04:30:27,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2021-01-07 04:30:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-07 04:30:27,747 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:27,748 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:27,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:27,964 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2021-01-07 04:30:27,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:27,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991094269] [2021-01-07 04:30:27,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:28,001 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:28,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775456150] [2021-01-07 04:30:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:28,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:30:28,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 04:30:28,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991094269] [2021-01-07 04:30:28,530 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:28,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775456150] [2021-01-07 04:30:28,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:28,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:30:28,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361072261] [2021-01-07 04:30:28,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:30:28,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:30:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:28,532 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2021-01-07 04:30:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:28,605 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2021-01-07 04:30:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:30:28,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-07 04:30:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:28,608 INFO L225 Difference]: With dead ends: 791 [2021-01-07 04:30:28,608 INFO L226 Difference]: Without dead ends: 426 [2021-01-07 04:30:28,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:30:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-01-07 04:30:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-01-07 04:30:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-07 04:30:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2021-01-07 04:30:28,627 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2021-01-07 04:30:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:28,628 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2021-01-07 04:30:28,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:30:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2021-01-07 04:30:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-07 04:30:28,631 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:28,631 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:28,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:30:28,845 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2021-01-07 04:30:28,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:28,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695593258] [2021-01-07 04:30:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:28,889 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:28,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830273171] [2021-01-07 04:30:28,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:29,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:29,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:29,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:30:29,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 04:30:29,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695593258] [2021-01-07 04:30:29,449 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:29,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830273171] [2021-01-07 04:30:29,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:29,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:30:29,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897693514] [2021-01-07 04:30:29,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:30:29,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:30:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:29,451 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2021-01-07 04:30:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:29,533 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2021-01-07 04:30:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:30:29,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-07 04:30:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:29,536 INFO L225 Difference]: With dead ends: 806 [2021-01-07 04:30:29,536 INFO L226 Difference]: Without dead ends: 434 [2021-01-07 04:30:29,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:30:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-01-07 04:30:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-01-07 04:30:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-07 04:30:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2021-01-07 04:30:29,555 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2021-01-07 04:30:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:29,555 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2021-01-07 04:30:29,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:30:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2021-01-07 04:30:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-07 04:30:29,559 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:29,559 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:29,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:29,773 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2021-01-07 04:30:29,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:29,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280078761] [2021-01-07 04:30:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:29,799 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:29,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834794453] [2021-01-07 04:30:29,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:30,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:30:30,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:30,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:30:30,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-07 04:30:30,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280078761] [2021-01-07 04:30:30,293 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:30,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834794453] [2021-01-07 04:30:30,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:30:30,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:30:30,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154677491] [2021-01-07 04:30:30,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:30:30,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:30:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:30,294 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2021-01-07 04:30:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:30,354 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2021-01-07 04:30:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:30:30,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-07 04:30:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:30,360 INFO L225 Difference]: With dead ends: 804 [2021-01-07 04:30:30,360 INFO L226 Difference]: Without dead ends: 432 [2021-01-07 04:30:30,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:30:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-07 04:30:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-01-07 04:30:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-07 04:30:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2021-01-07 04:30:30,379 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2021-01-07 04:30:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:30,379 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2021-01-07 04:30:30,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:30:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2021-01-07 04:30:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-01-07 04:30:30,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:30,383 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:30,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:30,598 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2021-01-07 04:30:30,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:30,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893775607] [2021-01-07 04:30:30,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:30,620 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:30,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156041656] [2021-01-07 04:30:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:30:30,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:30:30,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-07 04:30:31,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893775607] [2021-01-07 04:30:31,195 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:31,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156041656] [2021-01-07 04:30:31,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:31,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:30:31,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523124605] [2021-01-07 04:30:31,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:30:31,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:30:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:30:31,198 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2021-01-07 04:30:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:31,298 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2021-01-07 04:30:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:30:31,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2021-01-07 04:30:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:31,301 INFO L225 Difference]: With dead ends: 819 [2021-01-07 04:30:31,301 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:30:31,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:30:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:30:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-01-07 04:30:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2021-01-07 04:30:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2021-01-07 04:30:31,318 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2021-01-07 04:30:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:31,318 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2021-01-07 04:30:31,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:30:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2021-01-07 04:30:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 04:30:31,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:31,322 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:31,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:30:31,537 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2021-01-07 04:30:31,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:31,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279000075] [2021-01-07 04:30:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:31,558 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:31,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188162802] [2021-01-07 04:30:31,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:30:31,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:30:31,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:30:31,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:30:31,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:30:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-07 04:30:32,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279000075] [2021-01-07 04:30:32,165 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:30:32,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188162802] [2021-01-07 04:30:32,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:30:32,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:30:32,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003280384] [2021-01-07 04:30:32,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:30:32,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:30:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:30:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:30:32,170 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2021-01-07 04:30:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:30:32,270 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2021-01-07 04:30:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:30:32,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2021-01-07 04:30:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:30:32,273 INFO L225 Difference]: With dead ends: 834 [2021-01-07 04:30:32,274 INFO L226 Difference]: Without dead ends: 448 [2021-01-07 04:30:32,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:30:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-01-07 04:30:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-01-07 04:30:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2021-01-07 04:30:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2021-01-07 04:30:32,293 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2021-01-07 04:30:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:30:32,293 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2021-01-07 04:30:32,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:30:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2021-01-07 04:30:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:30:32,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:30:32,298 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:30:32,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:30:32,514 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:30:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:30:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2021-01-07 04:30:32,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:30:32,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545850247] [2021-01-07 04:30:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:30:32,535 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:30:32,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879420460] [2021-01-07 04:30:32,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true