/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_SAX_test4-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:39:41,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:39:41,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:39:41,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:39:41,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:39:41,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:39:41,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:39:41,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:39:41,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:39:41,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:39:41,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:39:41,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:39:41,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:39:41,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:39:41,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:39:41,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:39:41,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:39:41,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:39:41,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:39:41,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:39:41,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:39:41,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:39:41,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:39:41,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:39:41,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:39:41,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:39:41,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:39:41,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:39:41,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:39:41,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:39:41,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:39:41,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:39:41,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:39:41,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:39:41,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:39:41,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:39:41,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:39:41,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:39:41,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:39:41,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:39:41,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:39:41,386 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:39:41,442 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:39:41,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:39:41,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:39:41,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:39:41,447 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:39:41,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:39:41,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:39:41,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:39:41,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:39:41,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:39:41,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:39:41,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:39:41,450 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:39:41,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:39:41,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:39:41,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:39:41,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:39:41,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:39:41,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:39:41,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:39:41,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:39:41,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:39:41,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:39:41,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:39:41,453 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:39:41,453 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:39:41,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:39:42,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:39:42,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:39:42,027 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:39:42,028 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:39:42,029 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_SAX_test4-3.i [2021-01-07 04:39:42,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2ab891f84/b7623817fcec47cbb59ebffcada98246/FLAG877bcc37c [2021-01-07 04:39:42,931 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:39:42,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2021-01-07 04:39:42,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2ab891f84/b7623817fcec47cbb59ebffcada98246/FLAG877bcc37c [2021-01-07 04:39:43,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/2ab891f84/b7623817fcec47cbb59ebffcada98246 [2021-01-07 04:39:43,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:39:43,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:39:43,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:39:43,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:39:43,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:39:43,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:39:43" (1/1) ... [2021-01-07 04:39:43,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fdb741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:43, skipping insertion in model container [2021-01-07 04:39:43,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:39:43" (1/1) ... [2021-01-07 04:39:43,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:39:43,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:39:43,662 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_SAX_test4-3.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem280,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem280,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem285,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem285,],offset],IdentifierExpression[#t~mem287,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem291,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem291,],offset],IdentifierExpression[#t~mem293,]]]]] 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~mem305,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem305,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem308,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem308,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem321,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem321,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem326,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem326,],offset],IdentifierExpression[#t~mem328,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem332,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem332,],offset],IdentifierExpression[#t~mem334,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem346,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem346,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem349,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem349,],offset]]]] [2021-01-07 04:39:43,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:39:43,898 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:39:43,975 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_SAX_test4-3.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem293,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem293,],offset],IdentifierExpression[#t~mem295,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem299,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem299,],offset],IdentifierExpression[#t~mem301,]]]]] 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~mem313,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem313,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem316,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem316,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem329,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem329,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem334,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem334,],offset],IdentifierExpression[#t~mem336,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem340,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem340,],offset],IdentifierExpression[#t~mem342,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem354,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem354,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem357,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem357,],offset]]]] [2021-01-07 04:39:44,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:39:44,249 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:39:44,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44 WrapperNode [2021-01-07 04:39:44,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:39:44,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:39:44,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:39:44,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:39:44,261 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:39:44" (1/1) ... [2021-01-07 04:39:44,328 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:39:44" (1/1) ... [2021-01-07 04:39:44,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:39:44,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:39:44,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:39:44,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:39:44,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (1/1) ... [2021-01-07 04:39:44,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:39:44,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:39:44,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:39:44,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:39:44,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (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:39:44,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:39:44,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:39:44,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:39:44,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:39:44,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:39:44,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:39:44,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:39:44,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:39:44,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:39:44,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:39:47,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:39:47,800 INFO L299 CfgBuilder]: Removed 115 assume(true) statements. [2021-01-07 04:39:47,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:39:47 BoogieIcfgContainer [2021-01-07 04:39:47,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:39:47,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:39:47,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:39:47,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:39:47,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:39:43" (1/3) ... [2021-01-07 04:39:47,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@913cd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:39:47, skipping insertion in model container [2021-01-07 04:39:47,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:44" (2/3) ... [2021-01-07 04:39:47,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@913cd2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:39:47, skipping insertion in model container [2021-01-07 04:39:47,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:39:47" (3/3) ... [2021-01-07 04:39:47,814 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-3.i [2021-01-07 04:39:47,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:39:47,842 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2021-01-07 04:39:47,888 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-07 04:39:47,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:39:47,926 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:39:47,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:39:47,927 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:39:47,927 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:39:47,927 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:39:47,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:39:47,927 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:39:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2021-01-07 04:39:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:39:47,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:47,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:47,966 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:47,973 INFO L82 PathProgramCache]: Analyzing trace with hash 889550569, now seen corresponding path program 1 times [2021-01-07 04:39:47,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:47,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674378827] [2021-01-07 04:39:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:48,181 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:39:48,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674378827] [2021-01-07 04:39:48,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:48,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:39:48,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308428773] [2021-01-07 04:39:48,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:39:48,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:39:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:39:48,210 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 2 states. [2021-01-07 04:39:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:48,271 INFO L93 Difference]: Finished difference Result 540 states and 896 transitions. [2021-01-07 04:39:48,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:39:48,273 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:39:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:48,296 INFO L225 Difference]: With dead ends: 540 [2021-01-07 04:39:48,297 INFO L226 Difference]: Without dead ends: 217 [2021-01-07 04:39:48,306 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:39:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-07 04:39:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-01-07 04:39:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-07 04:39:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2021-01-07 04:39:48,397 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 8 [2021-01-07 04:39:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:48,398 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2021-01-07 04:39:48,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:39:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2021-01-07 04:39:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:39:48,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:48,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:48,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:39:48,402 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 921152950, now seen corresponding path program 1 times [2021-01-07 04:39:48,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:48,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399657300] [2021-01-07 04:39:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:48,517 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:39:48,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399657300] [2021-01-07 04:39:48,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:48,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:48,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901792442] [2021-01-07 04:39:48,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:48,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:48,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:48,521 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand 3 states. [2021-01-07 04:39:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:48,608 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2021-01-07 04:39:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:48,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 04:39:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:48,613 INFO L225 Difference]: With dead ends: 432 [2021-01-07 04:39:48,613 INFO L226 Difference]: Without dead ends: 387 [2021-01-07 04:39:48,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-01-07 04:39:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 218. [2021-01-07 04:39:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2021-01-07 04:39:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2021-01-07 04:39:48,638 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 8 [2021-01-07 04:39:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:48,639 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2021-01-07 04:39:48,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2021-01-07 04:39:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:39:48,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:48,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:48,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 04:39:48,652 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:48,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash -137963571, now seen corresponding path program 1 times [2021-01-07 04:39:48,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:48,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710348900] [2021-01-07 04:39:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:48,719 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:48,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226462134] [2021-01-07 04:39:48,721 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:39:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:49,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:49,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710348900] [2021-01-07 04:39:49,171 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:49,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226462134] [2021-01-07 04:39:49,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:49,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:49,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536457037] [2021-01-07 04:39:49,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:49,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:49,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:49,182 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand 3 states. [2021-01-07 04:39:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:49,313 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-01-07 04:39:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:49,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:39:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:49,317 INFO L225 Difference]: With dead ends: 454 [2021-01-07 04:39:49,318 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 04:39:49,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 04:39:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2021-01-07 04:39:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-07 04:39:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 303 transitions. [2021-01-07 04:39:49,356 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 303 transitions. Word has length 106 [2021-01-07 04:39:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:49,359 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 303 transitions. [2021-01-07 04:39:49,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 303 transitions. [2021-01-07 04:39:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:39:49,366 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:49,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:49,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-07 04:39:49,568 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 62310097, now seen corresponding path program 1 times [2021-01-07 04:39:49,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:49,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714287745] [2021-01-07 04:39:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:49,605 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:49,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306748137] [2021-01-07 04:39:49,606 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:39:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:49,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:49,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:50,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714287745] [2021-01-07 04:39:50,145 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:50,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306748137] [2021-01-07 04:39:50,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:50,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:50,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668862420] [2021-01-07 04:39:50,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:50,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:50,150 INFO L87 Difference]: Start difference. First operand 238 states and 303 transitions. Second operand 3 states. [2021-01-07 04:39:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:50,252 INFO L93 Difference]: Finished difference Result 494 states and 634 transitions. [2021-01-07 04:39:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:50,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 04:39:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:50,255 INFO L225 Difference]: With dead ends: 494 [2021-01-07 04:39:50,256 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 04:39:50,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 04:39:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2021-01-07 04:39:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2021-01-07 04:39:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2021-01-07 04:39:50,269 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 106 [2021-01-07 04:39:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:50,272 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2021-01-07 04:39:50,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2021-01-07 04:39:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:39:50,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:50,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:50,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:50,491 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -426500019, now seen corresponding path program 1 times [2021-01-07 04:39:50,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:50,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616922980] [2021-01-07 04:39:50,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:50,538 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:50,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829799121] [2021-01-07 04:39:50,538 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:39:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:50,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:50,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616922980] [2021-01-07 04:39:50,993 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:50,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829799121] [2021-01-07 04:39:50,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:50,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:50,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502924319] [2021-01-07 04:39:50,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:50,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:50,996 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand 4 states. [2021-01-07 04:39:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:51,091 INFO L93 Difference]: Finished difference Result 505 states and 635 transitions. [2021-01-07 04:39:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:51,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:39:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:51,094 INFO L225 Difference]: With dead ends: 505 [2021-01-07 04:39:51,094 INFO L226 Difference]: Without dead ends: 250 [2021-01-07 04:39:51,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-07 04:39:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2021-01-07 04:39:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2021-01-07 04:39:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2021-01-07 04:39:51,102 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 106 [2021-01-07 04:39:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:51,103 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2021-01-07 04:39:51,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2021-01-07 04:39:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:39:51,105 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:51,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:51,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:51,320 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1791075329, now seen corresponding path program 1 times [2021-01-07 04:39:51,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:51,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239671103] [2021-01-07 04:39:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:51,356 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:51,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696781364] [2021-01-07 04:39:51,360 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:39:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:51,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:51,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:51,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239671103] [2021-01-07 04:39:51,830 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:51,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696781364] [2021-01-07 04:39:51,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:51,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:51,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585892946] [2021-01-07 04:39:51,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:51,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:51,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:51,835 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand 4 states. [2021-01-07 04:39:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:51,957 INFO L93 Difference]: Finished difference Result 566 states and 702 transitions. [2021-01-07 04:39:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:51,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:39:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:51,961 INFO L225 Difference]: With dead ends: 566 [2021-01-07 04:39:51,961 INFO L226 Difference]: Without dead ends: 325 [2021-01-07 04:39:51,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-07 04:39:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 230. [2021-01-07 04:39:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-07 04:39:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2021-01-07 04:39:51,986 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 106 [2021-01-07 04:39:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:51,986 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2021-01-07 04:39:51,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2021-01-07 04:39:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 04:39:51,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:51,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:52,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:52,195 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:52,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1369189005, now seen corresponding path program 1 times [2021-01-07 04:39:52,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:52,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054962747] [2021-01-07 04:39:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:52,223 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:52,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008375679] [2021-01-07 04:39:52,224 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:39:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:52,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:52,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:52,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054962747] [2021-01-07 04:39:52,674 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:52,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008375679] [2021-01-07 04:39:52,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:52,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:39:52,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013088835] [2021-01-07 04:39:52,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:52,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:52,679 INFO L87 Difference]: Start difference. First operand 230 states and 281 transitions. Second operand 4 states. [2021-01-07 04:39:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:52,722 INFO L93 Difference]: Finished difference Result 638 states and 780 transitions. [2021-01-07 04:39:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:52,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2021-01-07 04:39:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:52,732 INFO L225 Difference]: With dead ends: 638 [2021-01-07 04:39:52,732 INFO L226 Difference]: Without dead ends: 593 [2021-01-07 04:39:52,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-01-07 04:39:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2021-01-07 04:39:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-07 04:39:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2021-01-07 04:39:52,757 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 106 [2021-01-07 04:39:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:52,759 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2021-01-07 04:39:52,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2021-01-07 04:39:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-07 04:39:52,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:52,763 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:52,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 04:39:52,977 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash 548829604, now seen corresponding path program 2 times [2021-01-07 04:39:52,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:52,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8519900] [2021-01-07 04:39:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:53,001 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:53,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147772687] [2021-01-07 04:39:53,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:53,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 04:39:53,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:39:53,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:39:53,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-01-07 04:39:53,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8519900] [2021-01-07 04:39:53,776 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:53,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147772687] [2021-01-07 04:39:53,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:53,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:53,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660255145] [2021-01-07 04:39:53,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:53,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:53,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:53,785 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand 4 states. [2021-01-07 04:39:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:54,277 INFO L93 Difference]: Finished difference Result 677 states and 831 transitions. [2021-01-07 04:39:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:54,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2021-01-07 04:39:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:54,281 INFO L225 Difference]: With dead ends: 677 [2021-01-07 04:39:54,281 INFO L226 Difference]: Without dead ends: 410 [2021-01-07 04:39:54,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-01-07 04:39:54,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-01-07 04:39:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2021-01-07 04:39:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 500 transitions. [2021-01-07 04:39:54,298 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 500 transitions. Word has length 204 [2021-01-07 04:39:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:54,298 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 500 transitions. [2021-01-07 04:39:54,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 500 transitions. [2021-01-07 04:39:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-07 04:39:54,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:54,302 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:54,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:54,518 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash -7696284, now seen corresponding path program 1 times [2021-01-07 04:39:54,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:54,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484854199] [2021-01-07 04:39:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:54,554 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:54,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097814781] [2021-01-07 04:39:54,555 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:39:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:55,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:55,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 04:39:55,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484854199] [2021-01-07 04:39:55,171 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:55,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097814781] [2021-01-07 04:39:55,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:55,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:55,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379225430] [2021-01-07 04:39:55,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:55,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:55,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:55,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:55,173 INFO L87 Difference]: Start difference. First operand 410 states and 500 transitions. Second operand 3 states. [2021-01-07 04:39:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:55,245 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2021-01-07 04:39:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:55,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2021-01-07 04:39:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:55,248 INFO L225 Difference]: With dead ends: 776 [2021-01-07 04:39:55,248 INFO L226 Difference]: Without dead ends: 418 [2021-01-07 04:39:55,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-01-07 04:39:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-01-07 04:39:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-07 04:39:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 508 transitions. [2021-01-07 04:39:55,265 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 508 transitions. Word has length 211 [2021-01-07 04:39:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:55,265 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 508 transitions. [2021-01-07 04:39:55,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 508 transitions. [2021-01-07 04:39:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-07 04:39:55,268 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:55,269 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:55,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:55,483 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1887603621, now seen corresponding path program 1 times [2021-01-07 04:39:55,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:55,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396475730] [2021-01-07 04:39:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:55,510 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:55,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6146371] [2021-01-07 04:39:55,510 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:39:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:55,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:39:56,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 04:39:56,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396475730] [2021-01-07 04:39:56,191 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:56,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6146371] [2021-01-07 04:39:56,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:56,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:39:56,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33325996] [2021-01-07 04:39:56,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:56,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:56,194 INFO L87 Difference]: Start difference. First operand 418 states and 508 transitions. Second operand 4 states. [2021-01-07 04:39:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:56,273 INFO L93 Difference]: Finished difference Result 791 states and 972 transitions. [2021-01-07 04:39:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:56,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2021-01-07 04:39:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:56,277 INFO L225 Difference]: With dead ends: 791 [2021-01-07 04:39:56,277 INFO L226 Difference]: Without dead ends: 426 [2021-01-07 04:39:56,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-01-07 04:39:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-01-07 04:39:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-07 04:39:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 516 transitions. [2021-01-07 04:39:56,295 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 516 transitions. Word has length 213 [2021-01-07 04:39:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:56,296 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 516 transitions. [2021-01-07 04:39:56,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 516 transitions. [2021-01-07 04:39:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-07 04:39:56,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:56,299 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:56,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 04:39:56,513 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash -546185468, now seen corresponding path program 2 times [2021-01-07 04:39:56,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:56,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660649439] [2021-01-07 04:39:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:56,540 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:56,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497852890] [2021-01-07 04:39:56,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:57,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:39:57,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:39:57,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:39:57,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-07 04:39:57,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660649439] [2021-01-07 04:39:57,265 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:57,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497852890] [2021-01-07 04:39:57,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:57,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:39:57,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005812851] [2021-01-07 04:39:57,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:39:57,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:39:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:57,267 INFO L87 Difference]: Start difference. First operand 426 states and 516 transitions. Second operand 5 states. [2021-01-07 04:39:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:57,348 INFO L93 Difference]: Finished difference Result 806 states and 987 transitions. [2021-01-07 04:39:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:39:57,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-07 04:39:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:57,351 INFO L225 Difference]: With dead ends: 806 [2021-01-07 04:39:57,351 INFO L226 Difference]: Without dead ends: 434 [2021-01-07 04:39:57,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-01-07 04:39:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-01-07 04:39:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-07 04:39:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 524 transitions. [2021-01-07 04:39:57,369 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 524 transitions. Word has length 215 [2021-01-07 04:39:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:57,369 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 524 transitions. [2021-01-07 04:39:57,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:39:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 524 transitions. [2021-01-07 04:39:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-07 04:39:57,372 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:57,373 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:57,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:57,588 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229253, now seen corresponding path program 3 times [2021-01-07 04:39:57,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:57,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952286632] [2021-01-07 04:39:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:57,631 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:57,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572139896] [2021-01-07 04:39:57,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:57,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:39:57,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:39:57,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:39:58,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-01-07 04:39:58,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952286632] [2021-01-07 04:39:58,339 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:58,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572139896] [2021-01-07 04:39:58,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:58,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:58,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403586538] [2021-01-07 04:39:58,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:58,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:58,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:58,341 INFO L87 Difference]: Start difference. First operand 434 states and 524 transitions. Second operand 3 states. [2021-01-07 04:39:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:58,427 INFO L93 Difference]: Finished difference Result 804 states and 976 transitions. [2021-01-07 04:39:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:58,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-07 04:39:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:58,433 INFO L225 Difference]: With dead ends: 804 [2021-01-07 04:39:58,433 INFO L226 Difference]: Without dead ends: 432 [2021-01-07 04:39:58,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-07 04:39:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-01-07 04:39:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-07 04:39:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 521 transitions. [2021-01-07 04:39:58,450 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 521 transitions. Word has length 217 [2021-01-07 04:39:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:58,451 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 521 transitions. [2021-01-07 04:39:58,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 521 transitions. [2021-01-07 04:39:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2021-01-07 04:39:58,454 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:58,455 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:58,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:58,666 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -511436746, now seen corresponding path program 1 times [2021-01-07 04:39:58,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:58,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14157936] [2021-01-07 04:39:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:58,688 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:58,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53295257] [2021-01-07 04:39:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:59,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:39:59,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-07 04:39:59,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14157936] [2021-01-07 04:39:59,453 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:59,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53295257] [2021-01-07 04:39:59,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:59,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:39:59,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169820283] [2021-01-07 04:39:59,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:39:59,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:59,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:39:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:39:59,455 INFO L87 Difference]: Start difference. First operand 432 states and 521 transitions. Second operand 6 states. [2021-01-07 04:39:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:59,570 INFO L93 Difference]: Finished difference Result 819 states and 999 transitions. [2021-01-07 04:39:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:39:59,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2021-01-07 04:39:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:59,574 INFO L225 Difference]: With dead ends: 819 [2021-01-07 04:39:59,574 INFO L226 Difference]: Without dead ends: 440 [2021-01-07 04:39:59,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:39:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-01-07 04:39:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-01-07 04:39:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2021-01-07 04:39:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 529 transitions. [2021-01-07 04:39:59,591 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 529 transitions. Word has length 230 [2021-01-07 04:39:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:59,592 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 529 transitions. [2021-01-07 04:39:59,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:39:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 529 transitions. [2021-01-07 04:39:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-01-07 04:39:59,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:59,596 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:59,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:39:59,812 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:59,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:59,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1844438796, now seen corresponding path program 2 times [2021-01-07 04:39:59,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:59,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089073944] [2021-01-07 04:39:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:59,834 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:59,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614995933] [2021-01-07 04:39:59,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:00,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:40:00,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:00,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:40:00,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-07 04:40:00,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089073944] [2021-01-07 04:40:00,656 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:00,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614995933] [2021-01-07 04:40:00,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:00,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:40:00,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951179824] [2021-01-07 04:40:00,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:40:00,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:40:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:40:00,658 INFO L87 Difference]: Start difference. First operand 440 states and 529 transitions. Second operand 7 states. [2021-01-07 04:40:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:00,779 INFO L93 Difference]: Finished difference Result 834 states and 1014 transitions. [2021-01-07 04:40:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:40:00,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2021-01-07 04:40:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:00,782 INFO L225 Difference]: With dead ends: 834 [2021-01-07 04:40:00,783 INFO L226 Difference]: Without dead ends: 448 [2021-01-07 04:40:00,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:40:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-01-07 04:40:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-01-07 04:40:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2021-01-07 04:40:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2021-01-07 04:40:00,800 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 234 [2021-01-07 04:40:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:00,800 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2021-01-07 04:40:00,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:40:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2021-01-07 04:40:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:40:00,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:00,802 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:01,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:40:01,016 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash 951531638, now seen corresponding path program 3 times [2021-01-07 04:40:01,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:01,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241352692] [2021-01-07 04:40:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:01,038 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:01,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188640151] [2021-01-07 04:40:01,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true