/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:49:02,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:49:02,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:49:02,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:49:02,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:49:02,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:49:02,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:49:02,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:49:02,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:49:02,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:49:02,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:49:02,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:49:02,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:49:02,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:49:02,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:49:02,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:49:02,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:49:02,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:49:02,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:49:02,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:49:02,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:49:02,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:49:02,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:49:02,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:49:02,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:49:02,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:49:02,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:49:02,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:49:02,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:49:02,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:49:02,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:49:02,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:49:02,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:49:02,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:49:02,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:49:02,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:49:02,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:49:02,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:49:02,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:49:02,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:49:02,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:49:02,702 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:49:02,761 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:49:02,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:49:02,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:49:02,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:49:02,765 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:49:02,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:49:02,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:49:02,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:49:02,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:49:02,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:49:02,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:49:02,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:49:02,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:49:02,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:49:02,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:49:02,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:49:02,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:49:02,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:49:02,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:49:02,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:49:02,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:49:02,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:49:02,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:49:02,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:49:02,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:49:02,773 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:49:03,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:49:03,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:49:03,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:49:03,311 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:49:03,312 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:49:03,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-01-07 04:49:03,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b820fc2a0/6a68a477c974408a85c24349de924149/FLAGea6cfd368 [2021-01-07 04:49:04,261 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:49:04,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-01-07 04:49:04,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b820fc2a0/6a68a477c974408a85c24349de924149/FLAGea6cfd368 [2021-01-07 04:49:04,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b820fc2a0/6a68a477c974408a85c24349de924149 [2021-01-07 04:49:04,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:49:04,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:49:04,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:49:04,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:49:04,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:49:04,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:49:04" (1/1) ... [2021-01-07 04:49:04,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c5ba51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:04, skipping insertion in model container [2021-01-07 04:49:04,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:49:04" (1/1) ... [2021-01-07 04:49:04,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:49:04,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:49:05,164 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~alt_malloc_sizes~0,GLOBAL],[IdentifierExpression[#t~post33,]]] [2021-01-07 04:49:05,182 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] 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~mem70,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem71,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem71,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem73,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem73,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem74,],base],StructAccessExpression[IdentifierExpression[#t~mem74,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem76,],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~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem89,],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~mem101,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem101,],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~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem122,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem122,],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~mem148,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem148,],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~mem158,],base],StructAccessExpression[IdentifierExpression[#t~mem158,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem159,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem159,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~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: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem224,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem224,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem229,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem229,],offset],IdentifierExpression[#t~mem231,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem235,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem235,],offset],IdentifierExpression[#t~mem237,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem249,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem249,],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]]]] [2021-01-07 04:49:05,377 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:49:05,378 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-01-07 04:49:05,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:49:05,409 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:49:05,450 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#alt_malloc_sizes~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post33,]]]]] [2021-01-07 04:49:05,454 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem76,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem76,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem77,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem77,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem78,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem78,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem79,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem79,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem80,],base],StructAccessExpression[IdentifierExpression[#t~mem80,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem82,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem82,],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~mem94,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem94,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem95,],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~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem107,],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~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem130,],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~mem157,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem157,],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~mem167,],base],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~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: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem236,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem236,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem241,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem241,],offset],IdentifierExpression[#t~mem243,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem247,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem247,],offset],IdentifierExpression[#t~mem249,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem261,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem261,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] [2021-01-07 04:49:05,597 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] [2021-01-07 04:49:05,598 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-01-07 04:49:05,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:49:05,830 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:49:05,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05 WrapperNode [2021-01-07 04:49:05,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:49:05,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:49:05,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:49:05,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:49:05,844 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:49:05" (1/1) ... [2021-01-07 04:49:05,925 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:49:05" (1/1) ... [2021-01-07 04:49:06,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:49:06,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:49:06,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:49:06,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:49:06,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (1/1) ... [2021-01-07 04:49:06,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:49:06,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:49:06,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:49:06,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:49:06,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (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:49:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:49:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:49:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:49:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:49:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:49:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:49:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:49:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:49:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:49:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:49:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:49:08,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:49:08,428 INFO L299 CfgBuilder]: Removed 111 assume(true) statements. [2021-01-07 04:49:08,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:49:08 BoogieIcfgContainer [2021-01-07 04:49:08,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:49:08,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:49:08,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:49:08,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:49:08,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:49:04" (1/3) ... [2021-01-07 04:49:08,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e5c862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:49:08, skipping insertion in model container [2021-01-07 04:49:08,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:49:05" (2/3) ... [2021-01-07 04:49:08,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e5c862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:49:08, skipping insertion in model container [2021-01-07 04:49:08,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:49:08" (3/3) ... [2021-01-07 04:49:08,442 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2021-01-07 04:49:08,451 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:49:08,457 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2021-01-07 04:49:08,484 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-01-07 04:49:08,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:49:08,518 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:49:08,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:49:08,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:49:08,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:49:08,519 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:49:08,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:49:08,519 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:49:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2021-01-07 04:49:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:49:08,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:08,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:08,554 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1030621672, now seen corresponding path program 1 times [2021-01-07 04:49:08,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:08,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162064124] [2021-01-07 04:49:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:08,833 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:49:08,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162064124] [2021-01-07 04:49:08,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:08,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:49:08,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572164599] [2021-01-07 04:49:08,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:49:08,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:49:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:49:08,872 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 2 states. [2021-01-07 04:49:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:08,962 INFO L93 Difference]: Finished difference Result 466 states and 739 transitions. [2021-01-07 04:49:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:49:08,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:49:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:08,988 INFO L225 Difference]: With dead ends: 466 [2021-01-07 04:49:08,988 INFO L226 Difference]: Without dead ends: 227 [2021-01-07 04:49:08,996 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:49:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-01-07 04:49:09,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-01-07 04:49:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2021-01-07 04:49:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 285 transitions. [2021-01-07 04:49:09,085 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 285 transitions. Word has length 8 [2021-01-07 04:49:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:09,086 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 285 transitions. [2021-01-07 04:49:09,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:49:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 285 transitions. [2021-01-07 04:49:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 04:49:09,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:09,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:09,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:49:09,089 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1260005844, now seen corresponding path program 1 times [2021-01-07 04:49:09,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:09,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290825142] [2021-01-07 04:49:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:09,192 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:49:09,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290825142] [2021-01-07 04:49:09,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:09,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:09,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310534887] [2021-01-07 04:49:09,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:09,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:09,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:09,197 INFO L87 Difference]: Start difference. First operand 227 states and 285 transitions. Second operand 4 states. [2021-01-07 04:49:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:09,732 INFO L93 Difference]: Finished difference Result 479 states and 601 transitions. [2021-01-07 04:49:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:09,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 04:49:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:09,738 INFO L225 Difference]: With dead ends: 479 [2021-01-07 04:49:09,738 INFO L226 Difference]: Without dead ends: 369 [2021-01-07 04:49:09,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-01-07 04:49:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 229. [2021-01-07 04:49:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2021-01-07 04:49:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 287 transitions. [2021-01-07 04:49:09,780 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 287 transitions. Word has length 10 [2021-01-07 04:49:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:09,781 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 287 transitions. [2021-01-07 04:49:09,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 287 transitions. [2021-01-07 04:49:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:49:09,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:09,784 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] [2021-01-07 04:49:09,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:49:09,785 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash -602340381, now seen corresponding path program 1 times [2021-01-07 04:49:09,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:09,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487347640] [2021-01-07 04:49:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:09,854 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:09,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066963361] [2021-01-07 04:49:09,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:10,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:10,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:10,155 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:49:10,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487347640] [2021-01-07 04:49:10,157 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:10,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066963361] [2021-01-07 04:49:10,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:10,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:10,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553996353] [2021-01-07 04:49:10,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:10,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:10,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:10,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:10,168 INFO L87 Difference]: Start difference. First operand 229 states and 287 transitions. Second operand 3 states. [2021-01-07 04:49:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:10,262 INFO L93 Difference]: Finished difference Result 475 states and 601 transitions. [2021-01-07 04:49:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:10,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-07 04:49:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:10,268 INFO L225 Difference]: With dead ends: 475 [2021-01-07 04:49:10,268 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 04:49:10,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 04:49:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-01-07 04:49:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-07 04:49:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 307 transitions. [2021-01-07 04:49:10,297 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 307 transitions. Word has length 44 [2021-01-07 04:49:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:10,298 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 307 transitions. [2021-01-07 04:49:10,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 307 transitions. [2021-01-07 04:49:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:49:10,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:10,302 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] [2021-01-07 04:49:10,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:49:10,516 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -821195099, now seen corresponding path program 1 times [2021-01-07 04:49:10,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:10,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592790659] [2021-01-07 04:49:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:10,549 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:10,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555017740] [2021-01-07 04:49:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:10,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:10,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:10,874 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:49:10,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592790659] [2021-01-07 04:49:10,875 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:10,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555017740] [2021-01-07 04:49:10,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:10,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:10,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647070901] [2021-01-07 04:49:10,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:10,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:10,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:10,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:10,878 INFO L87 Difference]: Start difference. First operand 249 states and 307 transitions. Second operand 4 states. [2021-01-07 04:49:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:10,988 INFO L93 Difference]: Finished difference Result 487 states and 603 transitions. [2021-01-07 04:49:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:10,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-07 04:49:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:10,990 INFO L225 Difference]: With dead ends: 487 [2021-01-07 04:49:10,991 INFO L226 Difference]: Without dead ends: 242 [2021-01-07 04:49:10,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-07 04:49:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235. [2021-01-07 04:49:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2021-01-07 04:49:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 286 transitions. [2021-01-07 04:49:11,000 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 286 transitions. Word has length 44 [2021-01-07 04:49:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:11,000 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 286 transitions. [2021-01-07 04:49:11,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 286 transitions. [2021-01-07 04:49:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 04:49:11,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:11,002 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] [2021-01-07 04:49:11,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:11,217 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1704043945, now seen corresponding path program 1 times [2021-01-07 04:49:11,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:11,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393116750] [2021-01-07 04:49:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:11,242 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:11,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726596773] [2021-01-07 04:49:11,243 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:49:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:11,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 04:49:11,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:11,591 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:49:11,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393116750] [2021-01-07 04:49:11,592 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:11,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726596773] [2021-01-07 04:49:11,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:11,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 04:49:11,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997373521] [2021-01-07 04:49:11,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:49:11,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:49:11,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:49:11,594 INFO L87 Difference]: Start difference. First operand 235 states and 286 transitions. Second operand 6 states. [2021-01-07 04:49:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:12,366 INFO L93 Difference]: Finished difference Result 447 states and 550 transitions. [2021-01-07 04:49:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:49:12,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-07 04:49:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:12,372 INFO L225 Difference]: With dead ends: 447 [2021-01-07 04:49:12,372 INFO L226 Difference]: Without dead ends: 445 [2021-01-07 04:49:12,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:49:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-01-07 04:49:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 233. [2021-01-07 04:49:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-01-07 04:49:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2021-01-07 04:49:12,384 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 44 [2021-01-07 04:49:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:12,384 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2021-01-07 04:49:12,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:49:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2021-01-07 04:49:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 04:49:12,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:12,397 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] [2021-01-07 04:49:12,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:12,613 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1088553020, now seen corresponding path program 1 times [2021-01-07 04:49:12,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:12,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372322852] [2021-01-07 04:49:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:12,661 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:12,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401488638] [2021-01-07 04:49:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:12,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:49:12,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:13,005 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:49:13,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372322852] [2021-01-07 04:49:13,006 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:13,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401488638] [2021-01-07 04:49:13,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:13,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:13,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971429884] [2021-01-07 04:49:13,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:49:13,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:49:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:13,009 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand 5 states. [2021-01-07 04:49:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:13,148 INFO L93 Difference]: Finished difference Result 940 states and 1155 transitions. [2021-01-07 04:49:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:49:13,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 04:49:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:13,153 INFO L225 Difference]: With dead ends: 940 [2021-01-07 04:49:13,154 INFO L226 Difference]: Without dead ends: 711 [2021-01-07 04:49:13,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-01-07 04:49:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 325. [2021-01-07 04:49:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2021-01-07 04:49:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 395 transitions. [2021-01-07 04:49:13,173 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 395 transitions. Word has length 51 [2021-01-07 04:49:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:13,173 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 395 transitions. [2021-01-07 04:49:13,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:49:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 395 transitions. [2021-01-07 04:49:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 04:49:13,174 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:13,175 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] [2021-01-07 04:49:13,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:13,389 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1193587178, now seen corresponding path program 1 times [2021-01-07 04:49:13,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:13,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247636328] [2021-01-07 04:49:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:13,421 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:13,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548817005] [2021-01-07 04:49:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:13,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:13,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:13,748 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:49:13,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247636328] [2021-01-07 04:49:13,748 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:13,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548817005] [2021-01-07 04:49:13,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:13,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:13,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107032674] [2021-01-07 04:49:13,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:49:13,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:49:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:13,751 INFO L87 Difference]: Start difference. First operand 325 states and 395 transitions. Second operand 3 states. [2021-01-07 04:49:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:13,890 INFO L93 Difference]: Finished difference Result 686 states and 832 transitions. [2021-01-07 04:49:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:49:13,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-07 04:49:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:13,893 INFO L225 Difference]: With dead ends: 686 [2021-01-07 04:49:13,893 INFO L226 Difference]: Without dead ends: 365 [2021-01-07 04:49:13,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:49:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-01-07 04:49:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 336. [2021-01-07 04:49:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2021-01-07 04:49:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 412 transitions. [2021-01-07 04:49:13,917 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 412 transitions. Word has length 54 [2021-01-07 04:49:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:13,919 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 412 transitions. [2021-01-07 04:49:13,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:49:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 412 transitions. [2021-01-07 04:49:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-07 04:49:13,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:13,925 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:14,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:49:14,139 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 901612414, now seen corresponding path program 1 times [2021-01-07 04:49:14,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:14,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205869507] [2021-01-07 04:49:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:14,160 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:14,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343346075] [2021-01-07 04:49:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:14,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:49:14,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:49:14,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205869507] [2021-01-07 04:49:14,542 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:14,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343346075] [2021-01-07 04:49:14,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:14,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:49:14,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230254861] [2021-01-07 04:49:14,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:14,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:14,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:14,546 INFO L87 Difference]: Start difference. First operand 336 states and 412 transitions. Second operand 4 states. [2021-01-07 04:49:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:14,678 INFO L93 Difference]: Finished difference Result 626 states and 773 transitions. [2021-01-07 04:49:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:14,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-07 04:49:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:14,682 INFO L225 Difference]: With dead ends: 626 [2021-01-07 04:49:14,682 INFO L226 Difference]: Without dead ends: 342 [2021-01-07 04:49:14,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 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:49:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-07 04:49:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2021-01-07 04:49:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2021-01-07 04:49:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 411 transitions. [2021-01-07 04:49:14,699 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 411 transitions. Word has length 78 [2021-01-07 04:49:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:14,699 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 411 transitions. [2021-01-07 04:49:14,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 411 transitions. [2021-01-07 04:49:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 04:49:14,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:14,700 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:14,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:14,914 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash -611683268, now seen corresponding path program 1 times [2021-01-07 04:49:14,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:14,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58048593] [2021-01-07 04:49:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:14,937 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:14,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026097754] [2021-01-07 04:49:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:15,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:49:15,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:15,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 04:49:15,313 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:49:15,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:49:15,317 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:49:15,318 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-01-07 04:49:15,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 04:49:15,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 04:49:15,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 04:49:15,347 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 04:49:15,347 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-01-07 04:49:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 04:49:15,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58048593] [2021-01-07 04:49:15,362 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:15,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026097754] [2021-01-07 04:49:15,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:15,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:49:15,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192095237] [2021-01-07 04:49:15,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:49:15,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:49:15,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:49:15,364 INFO L87 Difference]: Start difference. First operand 336 states and 411 transitions. Second operand 4 states. [2021-01-07 04:49:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:15,902 INFO L93 Difference]: Finished difference Result 447 states and 551 transitions. [2021-01-07 04:49:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:49:15,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-07 04:49:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:15,905 INFO L225 Difference]: With dead ends: 447 [2021-01-07 04:49:15,906 INFO L226 Difference]: Without dead ends: 431 [2021-01-07 04:49:15,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-01-07 04:49:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 338. [2021-01-07 04:49:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2021-01-07 04:49:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 413 transitions. [2021-01-07 04:49:15,922 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 413 transitions. Word has length 79 [2021-01-07 04:49:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:15,922 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 413 transitions. [2021-01-07 04:49:15,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:49:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 413 transitions. [2021-01-07 04:49:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 04:49:15,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:15,924 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] [2021-01-07 04:49:16,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:16,138 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1201768388, now seen corresponding path program 1 times [2021-01-07 04:49:16,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:16,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568940965] [2021-01-07 04:49:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:16,159 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:16,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740858753] [2021-01-07 04:49:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 04:49:16,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:16,548 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:49:16,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568940965] [2021-01-07 04:49:16,548 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:16,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740858753] [2021-01-07 04:49:16,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:49:16,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 04:49:16,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947106711] [2021-01-07 04:49:16,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:49:16,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:49:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:49:16,555 INFO L87 Difference]: Start difference. First operand 338 states and 413 transitions. Second operand 5 states. [2021-01-07 04:49:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:16,677 INFO L93 Difference]: Finished difference Result 626 states and 773 transitions. [2021-01-07 04:49:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:49:16,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-07 04:49:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:16,680 INFO L225 Difference]: With dead ends: 626 [2021-01-07 04:49:16,681 INFO L226 Difference]: Without dead ends: 340 [2021-01-07 04:49:16,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:49:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-01-07 04:49:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-01-07 04:49:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2021-01-07 04:49:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 415 transitions. [2021-01-07 04:49:16,699 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 415 transitions. Word has length 81 [2021-01-07 04:49:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:16,699 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 415 transitions. [2021-01-07 04:49:16,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:49:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 415 transitions. [2021-01-07 04:49:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 04:49:16,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:16,701 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] [2021-01-07 04:49:16,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:49:16,916 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1914773501, now seen corresponding path program 1 times [2021-01-07 04:49:16,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:16,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785737439] [2021-01-07 04:49:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:16,958 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:16,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497452863] [2021-01-07 04:49:16,959 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:49:17,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 04:49:17,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:49:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:49:17,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785737439] [2021-01-07 04:49:17,428 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:49:17,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497452863] [2021-01-07 04:49:17,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:49:17,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:49:17,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986919058] [2021-01-07 04:49:17,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:49:17,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:49:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:49:17,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:49:17,436 INFO L87 Difference]: Start difference. First operand 340 states and 415 transitions. Second operand 6 states. [2021-01-07 04:49:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:49:17,628 INFO L93 Difference]: Finished difference Result 630 states and 777 transitions. [2021-01-07 04:49:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:49:17,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2021-01-07 04:49:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:49:17,631 INFO L225 Difference]: With dead ends: 630 [2021-01-07 04:49:17,631 INFO L226 Difference]: Without dead ends: 342 [2021-01-07 04:49:17,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-01-07 04:49:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-01-07 04:49:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2021-01-07 04:49:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2021-01-07 04:49:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 417 transitions. [2021-01-07 04:49:17,648 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 417 transitions. Word has length 83 [2021-01-07 04:49:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:49:17,648 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 417 transitions. [2021-01-07 04:49:17,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:49:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 417 transitions. [2021-01-07 04:49:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 04:49:17,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:49:17,650 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:49:17,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:49:17,865 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.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:49:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:49:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 931638948, now seen corresponding path program 2 times [2021-01-07 04:49:17,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:49:17,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525252521] [2021-01-07 04:49:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:49:17,894 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:49:17,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905866154] [2021-01-07 04:49:17,895 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 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