/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_test5-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 04:39:43,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 04:39:43,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 04:39:43,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 04:39:43,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 04:39:43,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 04:39:43,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 04:39:43,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 04:39:43,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 04:39:43,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 04:39:43,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 04:39:43,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 04:39:43,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 04:39:43,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 04:39:43,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 04:39:43,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 04:39:43,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 04:39:43,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 04:39:43,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 04:39:43,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 04:39:43,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 04:39:43,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 04:39:43,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 04:39:43,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 04:39:43,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 04:39:43,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 04:39:43,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 04:39:43,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 04:39:43,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 04:39:43,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 04:39:43,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 04:39:43,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 04:39:43,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 04:39:43,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 04:39:43,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 04:39:43,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 04:39:43,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 04:39:43,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 04:39:43,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 04:39:43,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 04:39:43,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 04:39:43,601 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:43,655 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 04:39:43,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 04:39:43,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 04:39:43,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 04:39:43,658 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 04:39:43,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 04:39:43,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 04:39:43,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 04:39:43,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 04:39:43,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 04:39:43,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 04:39:43,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 04:39:43,660 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 04:39:43,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 04:39:43,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 04:39:43,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 04:39:43,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 04:39:43,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 04:39:43,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 04:39:43,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 04:39:43,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 04:39:43,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 04:39:43,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 04:39:43,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 04:39:43,663 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 04:39:43,664 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:44,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 04:39:44,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 04:39:44,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 04:39:44,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 04:39:44,114 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 04:39:44,115 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_test5-1.i [2021-01-07 04:39:44,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1aaa8b0ce/bbccb3b6508648a8be6fd7313e07912e/FLAG56a4f9f0e [2021-01-07 04:39:45,064 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 04:39:45,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2021-01-07 04:39:45,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1aaa8b0ce/bbccb3b6508648a8be6fd7313e07912e/FLAG56a4f9f0e [2021-01-07 04:39:45,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1aaa8b0ce/bbccb3b6508648a8be6fd7313e07912e [2021-01-07 04:39:45,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 04:39:45,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 04:39:45,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 04:39:45,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 04:39:45,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 04:39:45,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:39:45" (1/1) ... [2021-01-07 04:39:45,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2e791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:45, skipping insertion in model container [2021-01-07 04:39:45,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 04:39:45" (1/1) ... [2021-01-07 04:39:45,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 04:39:45,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 04:39:45,981 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_test5-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:39:46,261 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_test5-1.i[49681,49694] [2021-01-07 04:39:46,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:39:46,286 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 04:39:46,322 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_test5-1.i[33021,33034] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem83,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem83,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem120,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem128,],base],StructAccessExpression[IdentifierExpression[#t~mem128,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem140,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem140,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem170,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem170,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem172,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem172,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem173,],base],StructAccessExpression[IdentifierExpression[#t~mem173,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem188,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem188,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem189,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem189,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem201,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem215,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem225,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem225,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem252,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem252,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem262,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem262,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem272,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~#j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] [2021-01-07 04:39:46,436 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_test5-1.i[49681,49694] [2021-01-07 04:39:46,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 04:39:46,539 INFO L208 MainTranslator]: Completed translation [2021-01-07 04:39:46,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:46 WrapperNode [2021-01-07 04:39:46,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 04:39:46,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 04:39:46,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 04:39:46,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 04:39:46,551 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:46" (1/1) ... [2021-01-07 04:39:46,625 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:46" (1/1) ... [2021-01-07 04:39:46,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 04:39:46,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 04:39:46,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 04:39:46,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 04:39:46,772 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:46" (1/1) ... [2021-01-07 04:39:46,775 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:46" (1/1) ... [2021-01-07 04:39:46,801 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:46" (1/1) ... [2021-01-07 04:39:46,802 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:46" (1/1) ... [2021-01-07 04:39:46,930 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:46" (1/1) ... [2021-01-07 04:39:46,970 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:46" (1/1) ... [2021-01-07 04:39:46,993 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:46" (1/1) ... [2021-01-07 04:39:47,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 04:39:47,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 04:39:47,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 04:39:47,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 04:39:47,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:46" (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:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 04:39:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 04:39:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 04:39:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 04:39:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 04:39:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 04:39:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 04:39:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 04:39:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 04:39:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 04:39:47,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 04:39:49,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 04:39:49,620 INFO L299 CfgBuilder]: Removed 111 assume(true) statements. [2021-01-07 04:39:49,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:39:49 BoogieIcfgContainer [2021-01-07 04:39:49,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 04:39:49,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 04:39:49,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 04:39:49,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 04:39:49,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 04:39:45" (1/3) ... [2021-01-07 04:39:49,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43742426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:39:49, skipping insertion in model container [2021-01-07 04:39:49,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 04:39:46" (2/3) ... [2021-01-07 04:39:49,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43742426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 04:39:49, skipping insertion in model container [2021-01-07 04:39:49,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 04:39:49" (3/3) ... [2021-01-07 04:39:49,633 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2021-01-07 04:39:49,642 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 04:39:49,649 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 04:39:49,674 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 04:39:49,708 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 04:39:49,709 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 04:39:49,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 04:39:49,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 04:39:49,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 04:39:49,709 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 04:39:49,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 04:39:49,710 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 04:39:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states. [2021-01-07 04:39:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 04:39:49,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:49,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:49,738 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash 889803109, now seen corresponding path program 1 times [2021-01-07 04:39:49,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:49,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325142134] [2021-01-07 04:39:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:49,975 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:49,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325142134] [2021-01-07 04:39:49,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:49,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 04:39:49,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261867261] [2021-01-07 04:39:49,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 04:39:49,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 04:39:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 04:39:50,005 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 2 states. [2021-01-07 04:39:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:50,080 INFO L93 Difference]: Finished difference Result 514 states and 864 transitions. [2021-01-07 04:39:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 04:39:50,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2021-01-07 04:39:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:50,108 INFO L225 Difference]: With dead ends: 514 [2021-01-07 04:39:50,108 INFO L226 Difference]: Without dead ends: 254 [2021-01-07 04:39:50,118 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:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-01-07 04:39:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-01-07 04:39:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-07 04:39:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 333 transitions. [2021-01-07 04:39:50,229 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 333 transitions. Word has length 8 [2021-01-07 04:39:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:50,230 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 333 transitions. [2021-01-07 04:39:50,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 04:39:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 333 transitions. [2021-01-07 04:39:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 04:39:50,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:50,235 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] [2021-01-07 04:39:50,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 04:39:50,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash -680083191, now seen corresponding path program 1 times [2021-01-07 04:39:50,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:50,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964879497] [2021-01-07 04:39:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:50,263 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:50,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203383638] [2021-01-07 04:39:50,264 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:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:50,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-07 04:39:50,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:50,623 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:50,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964879497] [2021-01-07 04:39:50,624 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:50,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203383638] [2021-01-07 04:39:50,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:50,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:50,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288861595] [2021-01-07 04:39:50,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:50,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:50,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:50,635 INFO L87 Difference]: Start difference. First operand 254 states and 333 transitions. Second operand 3 states. [2021-01-07 04:39:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:50,717 INFO L93 Difference]: Finished difference Result 587 states and 769 transitions. [2021-01-07 04:39:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:50,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-07 04:39:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:50,727 INFO L225 Difference]: With dead ends: 587 [2021-01-07 04:39:50,727 INFO L226 Difference]: Without dead ends: 505 [2021-01-07 04:39:50,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-01-07 04:39:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 255. [2021-01-07 04:39:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2021-01-07 04:39:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 334 transitions. [2021-01-07 04:39:50,781 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 334 transitions. Word has length 42 [2021-01-07 04:39:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:50,782 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 334 transitions. [2021-01-07 04:39:50,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 334 transitions. [2021-01-07 04:39:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:50,789 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:50,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:51,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-01-07 04:39:51,004 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1837409632, now seen corresponding path program 1 times [2021-01-07 04:39:51,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:51,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611643946] [2021-01-07 04:39:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:51,039 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:51,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109873059] [2021-01-07 04:39:51,039 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:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:51,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:51,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:51,541 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,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611643946] [2021-01-07 04:39:51,542 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:51,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109873059] [2021-01-07 04:39:51,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:51,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:51,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758971988] [2021-01-07 04:39:51,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:51,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:51,557 INFO L87 Difference]: Start difference. First operand 255 states and 334 transitions. Second operand 3 states. [2021-01-07 04:39:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:51,676 INFO L93 Difference]: Finished difference Result 528 states and 696 transitions. [2021-01-07 04:39:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:51,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:39:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:51,678 INFO L225 Difference]: With dead ends: 528 [2021-01-07 04:39:51,679 INFO L226 Difference]: Without dead ends: 276 [2021-01-07 04:39:51,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-07 04:39:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2021-01-07 04:39:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2021-01-07 04:39:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 354 transitions. [2021-01-07 04:39:51,708 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 354 transitions. Word has length 140 [2021-01-07 04:39:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:51,709 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 354 transitions. [2021-01-07 04:39:51,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 354 transitions. [2021-01-07 04:39:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:51,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:51,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:51,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:51,943 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1273244828, now seen corresponding path program 1 times [2021-01-07 04:39:51,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:51,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4418302] [2021-01-07 04:39:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:51,976 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:51,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832293284] [2021-01-07 04:39:51,977 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:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:52,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:52,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:52,459 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:52,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4418302] [2021-01-07 04:39:52,460 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:52,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832293284] [2021-01-07 04:39:52,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:52,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:52,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626738071] [2021-01-07 04:39:52,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:52,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:52,463 INFO L87 Difference]: Start difference. First operand 275 states and 354 transitions. Second operand 3 states. [2021-01-07 04:39:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:52,563 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2021-01-07 04:39:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:52,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:39:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:52,566 INFO L225 Difference]: With dead ends: 568 [2021-01-07 04:39:52,566 INFO L226 Difference]: Without dead ends: 296 [2021-01-07 04:39:52,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-01-07 04:39:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2021-01-07 04:39:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-07 04:39:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 374 transitions. [2021-01-07 04:39:52,577 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 374 transitions. Word has length 140 [2021-01-07 04:39:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:52,578 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 374 transitions. [2021-01-07 04:39:52,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 374 transitions. [2021-01-07 04:39:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:52,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:52,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:52,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:52,795 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash -882913824, now seen corresponding path program 1 times [2021-01-07 04:39:52,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:52,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513134867] [2021-01-07 04:39:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:52,836 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:52,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338962001] [2021-01-07 04:39:52,838 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:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:53,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:53,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:39:53,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513134867] [2021-01-07 04:39:53,321 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:53,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338962001] [2021-01-07 04:39:53,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:53,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:53,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299913299] [2021-01-07 04:39:53,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:53,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:53,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:53,325 INFO L87 Difference]: Start difference. First operand 295 states and 374 transitions. Second operand 3 states. [2021-01-07 04:39:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:53,453 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2021-01-07 04:39:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:53,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2021-01-07 04:39:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:53,462 INFO L225 Difference]: With dead ends: 397 [2021-01-07 04:39:53,462 INFO L226 Difference]: Without dead ends: 316 [2021-01-07 04:39:53,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-07 04:39:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2021-01-07 04:39:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2021-01-07 04:39:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2021-01-07 04:39:53,472 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 140 [2021-01-07 04:39:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:53,478 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2021-01-07 04:39:53,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2021-01-07 04:39:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:53,482 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:53,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:53,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:53,698 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 115522276, now seen corresponding path program 1 times [2021-01-07 04:39:53,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:53,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294832321] [2021-01-07 04:39:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:53,750 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:53,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027030742] [2021-01-07 04:39:53,751 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:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:54,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:54,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:54,207 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:54,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294832321] [2021-01-07 04:39:54,208 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:54,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027030742] [2021-01-07 04:39:54,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:54,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:54,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449127849] [2021-01-07 04:39:54,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:54,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:54,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:54,211 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 4 states. [2021-01-07 04:39:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:54,322 INFO L93 Difference]: Finished difference Result 619 states and 777 transitions. [2021-01-07 04:39:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:54,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:39:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:54,325 INFO L225 Difference]: With dead ends: 619 [2021-01-07 04:39:54,325 INFO L226 Difference]: Without dead ends: 307 [2021-01-07 04:39:54,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-01-07 04:39:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2021-01-07 04:39:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-01-07 04:39:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 373 transitions. [2021-01-07 04:39:54,337 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 373 transitions. Word has length 140 [2021-01-07 04:39:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:54,337 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 373 transitions. [2021-01-07 04:39:54,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 373 transitions. [2021-01-07 04:39:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:54,339 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:54,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:54,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-01-07 04:39:54,554 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:54,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash 32737814, now seen corresponding path program 1 times [2021-01-07 04:39:54,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:54,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841799885] [2021-01-07 04:39:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:54,582 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:54,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375618493] [2021-01-07 04:39:54,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:54,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:54,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:55,038 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:55,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841799885] [2021-01-07 04:39:55,039 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:55,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375618493] [2021-01-07 04:39:55,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:55,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:55,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243054416] [2021-01-07 04:39:55,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:55,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:55,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:55,042 INFO L87 Difference]: Start difference. First operand 301 states and 373 transitions. Second operand 4 states. [2021-01-07 04:39:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:55,136 INFO L93 Difference]: Finished difference Result 680 states and 844 transitions. [2021-01-07 04:39:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:55,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:39:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:55,139 INFO L225 Difference]: With dead ends: 680 [2021-01-07 04:39:55,140 INFO L226 Difference]: Without dead ends: 382 [2021-01-07 04:39:55,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-01-07 04:39:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 287. [2021-01-07 04:39:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2021-01-07 04:39:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2021-01-07 04:39:55,153 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 140 [2021-01-07 04:39:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:55,154 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2021-01-07 04:39:55,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2021-01-07 04:39:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:55,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:55,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:55,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:55,372 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:55,373 INFO L82 PathProgramCache]: Analyzing trace with hash -577227484, now seen corresponding path program 1 times [2021-01-07 04:39:55,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:55,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917872802] [2021-01-07 04:39:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:55,397 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:55,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689654317] [2021-01-07 04:39:55,397 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:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:55,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:55,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 04:39:55,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917872802] [2021-01-07 04:39:55,903 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:55,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689654317] [2021-01-07 04:39:55,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:55,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 04:39:55,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41660552] [2021-01-07 04:39:55,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:55,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:55,906 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand 4 states. [2021-01-07 04:39:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:56,002 INFO L93 Difference]: Finished difference Result 379 states and 468 transitions. [2021-01-07 04:39:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:56,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:39:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:56,005 INFO L225 Difference]: With dead ends: 379 [2021-01-07 04:39:56,005 INFO L226 Difference]: Without dead ends: 278 [2021-01-07 04:39:56,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-01-07 04:39:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2021-01-07 04:39:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2021-01-07 04:39:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 331 transitions. [2021-01-07 04:39:56,015 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 331 transitions. Word has length 140 [2021-01-07 04:39:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:56,016 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 331 transitions. [2021-01-07 04:39:56,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 331 transitions. [2021-01-07 04:39:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-07 04:39:56,017 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:56,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:56,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:56,233 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:56,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1460076330, now seen corresponding path program 1 times [2021-01-07 04:39:56,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:56,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533617517] [2021-01-07 04:39:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:56,255 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:56,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319075631] [2021-01-07 04:39:56,256 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:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:39:56,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:39:56,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:56,787 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:56,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533617517] [2021-01-07 04:39:56,791 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:56,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319075631] [2021-01-07 04:39:56,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:56,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:39:56,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249696766] [2021-01-07 04:39:56,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:39:56,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:39:56,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:56,794 INFO L87 Difference]: Start difference. First operand 273 states and 331 transitions. Second operand 4 states. [2021-01-07 04:39:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:56,856 INFO L93 Difference]: Finished difference Result 811 states and 984 transitions. [2021-01-07 04:39:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:39:56,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-07 04:39:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:56,861 INFO L225 Difference]: With dead ends: 811 [2021-01-07 04:39:56,861 INFO L226 Difference]: Without dead ends: 723 [2021-01-07 04:39:56,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:39:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-01-07 04:39:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 455. [2021-01-07 04:39:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2021-01-07 04:39:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 553 transitions. [2021-01-07 04:39:56,882 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 553 transitions. Word has length 140 [2021-01-07 04:39:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:56,882 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 553 transitions. [2021-01-07 04:39:56,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:39:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 553 transitions. [2021-01-07 04:39:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-01-07 04:39:56,886 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:56,886 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:57,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-01-07 04:39:57,102 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1379453485, now seen corresponding path program 2 times [2021-01-07 04:39:57,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:57,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105727884] [2021-01-07 04:39:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:57,132 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:57,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152645275] [2021-01-07 04:39:57,132 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,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:39:57,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:39:57,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:39:57,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 04:39:57,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105727884] [2021-01-07 04:39:57,926 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:57,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152645275] [2021-01-07 04:39:57,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:39:57,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:39:57,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294651507] [2021-01-07 04:39:57,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:39:57,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:39:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:57,928 INFO L87 Difference]: Start difference. First operand 455 states and 553 transitions. Second operand 5 states. [2021-01-07 04:39:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:58,013 INFO L93 Difference]: Finished difference Result 1080 states and 1310 transitions. [2021-01-07 04:39:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:39:58,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2021-01-07 04:39:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:58,020 INFO L225 Difference]: With dead ends: 1080 [2021-01-07 04:39:58,020 INFO L226 Difference]: Without dead ends: 992 [2021-01-07 04:39:58,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:39:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-01-07 04:39:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 637. [2021-01-07 04:39:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2021-01-07 04:39:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2021-01-07 04:39:58,045 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 238 [2021-01-07 04:39:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:58,046 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2021-01-07 04:39:58,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:39:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2021-01-07 04:39:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2021-01-07 04:39:58,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:58,052 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:58,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:58,267 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 449267140, now seen corresponding path program 3 times [2021-01-07 04:39:58,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:58,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222833674] [2021-01-07 04:39:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:58,302 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:58,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003916741] [2021-01-07 04:39:58,304 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:58,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:39:58,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:39:58,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:39:58,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:39:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-01-07 04:39:59,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222833674] [2021-01-07 04:39:59,296 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:39:59,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003916741] [2021-01-07 04:39:59,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:39:59,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:39:59,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954811799] [2021-01-07 04:39:59,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:39:59,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:39:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:39:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:59,299 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 3 states. [2021-01-07 04:39:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:39:59,376 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2021-01-07 04:39:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:39:59,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2021-01-07 04:39:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:39:59,383 INFO L225 Difference]: With dead ends: 1216 [2021-01-07 04:39:59,383 INFO L226 Difference]: Without dead ends: 635 [2021-01-07 04:39:59,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:39:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-01-07 04:39:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2021-01-07 04:39:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2021-01-07 04:39:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 772 transitions. [2021-01-07 04:39:59,412 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 772 transitions. Word has length 336 [2021-01-07 04:39:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:39:59,412 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 772 transitions. [2021-01-07 04:39:59,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:39:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 772 transitions. [2021-01-07 04:39:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2021-01-07 04:39:59,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:39:59,420 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:39:59,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:39:59,635 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:39:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:39:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1855273396, now seen corresponding path program 1 times [2021-01-07 04:39:59,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:39:59,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497108534] [2021-01-07 04:39:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:39:59,666 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:39:59,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332314781] [2021-01-07 04:39:59,667 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:40:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:00,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 04:40:00,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2021-01-07 04:40:00,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497108534] [2021-01-07 04:40:00,532 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:00,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332314781] [2021-01-07 04:40:00,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:00,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:00,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849236467] [2021-01-07 04:40:00,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:40:00,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:40:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:00,534 INFO L87 Difference]: Start difference. First operand 635 states and 772 transitions. Second operand 3 states. [2021-01-07 04:40:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:00,598 INFO L93 Difference]: Finished difference Result 1232 states and 1512 transitions. [2021-01-07 04:40:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:40:00,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2021-01-07 04:40:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:00,604 INFO L225 Difference]: With dead ends: 1232 [2021-01-07 04:40:00,605 INFO L226 Difference]: Without dead ends: 647 [2021-01-07 04:40:00,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-01-07 04:40:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2021-01-07 04:40:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2021-01-07 04:40:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 784 transitions. [2021-01-07 04:40:00,630 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 784 transitions. Word has length 343 [2021-01-07 04:40:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:00,630 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 784 transitions. [2021-01-07 04:40:00,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:40:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 784 transitions. [2021-01-07 04:40:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2021-01-07 04:40:00,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:00,638 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:00,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 04:40:00,853 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:00,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash 162679507, now seen corresponding path program 1 times [2021-01-07 04:40:00,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:00,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958679296] [2021-01-07 04:40:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:00,882 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:00,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398767373] [2021-01-07 04:40:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:01,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 04:40:01,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 73 proven. 1 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2021-01-07 04:40:01,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958679296] [2021-01-07 04:40:01,777 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:01,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398767373] [2021-01-07 04:40:01,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:01,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2021-01-07 04:40:01,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531499536] [2021-01-07 04:40:01,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 04:40:01,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 04:40:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:01,779 INFO L87 Difference]: Start difference. First operand 647 states and 784 transitions. Second operand 4 states. [2021-01-07 04:40:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:01,865 INFO L93 Difference]: Finished difference Result 1255 states and 1535 transitions. [2021-01-07 04:40:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 04:40:01,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 345 [2021-01-07 04:40:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:01,869 INFO L225 Difference]: With dead ends: 1255 [2021-01-07 04:40:01,869 INFO L226 Difference]: Without dead ends: 659 [2021-01-07 04:40:01,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 04:40:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-01-07 04:40:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2021-01-07 04:40:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2021-01-07 04:40:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 796 transitions. [2021-01-07 04:40:01,895 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 796 transitions. Word has length 345 [2021-01-07 04:40:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:01,895 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 796 transitions. [2021-01-07 04:40:01,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 04:40:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 796 transitions. [2021-01-07 04:40:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2021-01-07 04:40:01,901 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:01,901 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:02,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 04:40:02,116 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1649703700, now seen corresponding path program 2 times [2021-01-07 04:40:02,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:02,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061524959] [2021-01-07 04:40:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:02,144 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:02,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181968855] [2021-01-07 04:40:02,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:02,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:40:02,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:02,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:40:02,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 73 proven. 3 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-01-07 04:40:03,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061524959] [2021-01-07 04:40:03,108 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:03,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181968855] [2021-01-07 04:40:03,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:03,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-01-07 04:40:03,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510069801] [2021-01-07 04:40:03,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 04:40:03,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 04:40:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:03,111 INFO L87 Difference]: Start difference. First operand 659 states and 796 transitions. Second operand 5 states. [2021-01-07 04:40:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:03,234 INFO L93 Difference]: Finished difference Result 1278 states and 1558 transitions. [2021-01-07 04:40:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 04:40:03,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 347 [2021-01-07 04:40:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:03,239 INFO L225 Difference]: With dead ends: 1278 [2021-01-07 04:40:03,240 INFO L226 Difference]: Without dead ends: 671 [2021-01-07 04:40:03,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 04:40:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2021-01-07 04:40:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2021-01-07 04:40:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2021-01-07 04:40:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 808 transitions. [2021-01-07 04:40:03,276 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 808 transitions. Word has length 347 [2021-01-07 04:40:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:03,277 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 808 transitions. [2021-01-07 04:40:03,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 04:40:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 808 transitions. [2021-01-07 04:40:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2021-01-07 04:40:03,281 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:03,282 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:03,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 04:40:03,497 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash 457445491, now seen corresponding path program 3 times [2021-01-07 04:40:03,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:03,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202102099] [2021-01-07 04:40:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:03,536 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:03,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766517074] [2021-01-07 04:40:03,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:03,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:40:03,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:03,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:40:03,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2021-01-07 04:40:04,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202102099] [2021-01-07 04:40:04,719 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:04,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766517074] [2021-01-07 04:40:04,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:04,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:04,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780828617] [2021-01-07 04:40:04,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:40:04,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:40:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:04,721 INFO L87 Difference]: Start difference. First operand 671 states and 808 transitions. Second operand 3 states. [2021-01-07 04:40:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:04,820 INFO L93 Difference]: Finished difference Result 1256 states and 1514 transitions. [2021-01-07 04:40:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:40:04,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2021-01-07 04:40:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:04,824 INFO L225 Difference]: With dead ends: 1256 [2021-01-07 04:40:04,825 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:40:04,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:40:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2021-01-07 04:40:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2021-01-07 04:40:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 880 transitions. [2021-01-07 04:40:04,859 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 880 transitions. Word has length 349 [2021-01-07 04:40:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:04,860 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 880 transitions. [2021-01-07 04:40:04,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:40:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 880 transitions. [2021-01-07 04:40:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2021-01-07 04:40:04,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:04,863 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:05,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:05,078 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2060178602, now seen corresponding path program 1 times [2021-01-07 04:40:05,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:05,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410810195] [2021-01-07 04:40:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:05,104 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:05,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920363859] [2021-01-07 04:40:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:05,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 04:40:05,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-01-07 04:40:06,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410810195] [2021-01-07 04:40:06,102 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:06,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920363859] [2021-01-07 04:40:06,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:06,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2021-01-07 04:40:06,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852135341] [2021-01-07 04:40:06,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 04:40:06,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 04:40:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:40:06,104 INFO L87 Difference]: Start difference. First operand 728 states and 880 transitions. Second operand 6 states. [2021-01-07 04:40:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:06,209 INFO L93 Difference]: Finished difference Result 1415 states and 1725 transitions. [2021-01-07 04:40:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 04:40:06,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2021-01-07 04:40:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:06,213 INFO L225 Difference]: With dead ends: 1415 [2021-01-07 04:40:06,214 INFO L226 Difference]: Without dead ends: 740 [2021-01-07 04:40:06,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 04:40:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-01-07 04:40:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2021-01-07 04:40:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2021-01-07 04:40:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 892 transitions. [2021-01-07 04:40:06,242 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 892 transitions. Word has length 362 [2021-01-07 04:40:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:06,242 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 892 transitions. [2021-01-07 04:40:06,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 04:40:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 892 transitions. [2021-01-07 04:40:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-01-07 04:40:06,245 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:06,246 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:06,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 04:40:06,460 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1507573012, now seen corresponding path program 2 times [2021-01-07 04:40:06,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:06,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807733059] [2021-01-07 04:40:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:06,487 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:06,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591786610] [2021-01-07 04:40:06,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:07,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:40:07,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:07,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 04:40:07,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 73 proven. 10 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2021-01-07 04:40:07,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807733059] [2021-01-07 04:40:07,758 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:07,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591786610] [2021-01-07 04:40:07,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:07,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-07 04:40:07,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656357032] [2021-01-07 04:40:07,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 04:40:07,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 04:40:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:40:07,764 INFO L87 Difference]: Start difference. First operand 740 states and 892 transitions. Second operand 7 states. [2021-01-07 04:40:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:07,879 INFO L93 Difference]: Finished difference Result 1438 states and 1748 transitions. [2021-01-07 04:40:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 04:40:07,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2021-01-07 04:40:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:07,884 INFO L225 Difference]: With dead ends: 1438 [2021-01-07 04:40:07,884 INFO L226 Difference]: Without dead ends: 752 [2021-01-07 04:40:07,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 04:40:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-01-07 04:40:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2021-01-07 04:40:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2021-01-07 04:40:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 904 transitions. [2021-01-07 04:40:07,912 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 904 transitions. Word has length 366 [2021-01-07 04:40:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:07,912 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 904 transitions. [2021-01-07 04:40:07,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 04:40:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 904 transitions. [2021-01-07 04:40:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-01-07 04:40:07,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:07,916 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:08,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 04:40:08,127 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 823733142, now seen corresponding path program 3 times [2021-01-07 04:40:08,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:08,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803390673] [2021-01-07 04:40:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:08,163 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:08,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949199786] [2021-01-07 04:40:08,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:08,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 04:40:08,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:08,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 04:40:08,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2021-01-07 04:40:09,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803390673] [2021-01-07 04:40:09,254 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:09,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949199786] [2021-01-07 04:40:09,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 04:40:09,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 04:40:09,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064545035] [2021-01-07 04:40:09,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 04:40:09,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 04:40:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:09,256 INFO L87 Difference]: Start difference. First operand 752 states and 904 transitions. Second operand 3 states. [2021-01-07 04:40:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:09,388 INFO L93 Difference]: Finished difference Result 1376 states and 1653 transitions. [2021-01-07 04:40:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 04:40:09,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2021-01-07 04:40:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:09,395 INFO L225 Difference]: With dead ends: 1376 [2021-01-07 04:40:09,395 INFO L226 Difference]: Without dead ends: 1027 [2021-01-07 04:40:09,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 04:40:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2021-01-07 04:40:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1015. [2021-01-07 04:40:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2021-01-07 04:40:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1222 transitions. [2021-01-07 04:40:09,448 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1222 transitions. Word has length 370 [2021-01-07 04:40:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:09,450 INFO L481 AbstractCegarLoop]: Abstraction has 1015 states and 1222 transitions. [2021-01-07 04:40:09,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 04:40:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1222 transitions. [2021-01-07 04:40:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2021-01-07 04:40:09,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:09,457 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:09,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 04:40:09,664 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:09,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash -145231630, now seen corresponding path program 1 times [2021-01-07 04:40:09,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:09,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138710000] [2021-01-07 04:40:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:09,694 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:09,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122593145] [2021-01-07 04:40:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 04:40:10,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 04:40:10,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 73 proven. 15 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-01-07 04:40:10,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138710000] [2021-01-07 04:40:10,796 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:10,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122593145] [2021-01-07 04:40:10,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:10,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-01-07 04:40:10,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869079759] [2021-01-07 04:40:10,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 04:40:10,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 04:40:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:40:10,802 INFO L87 Difference]: Start difference. First operand 1015 states and 1222 transitions. Second operand 8 states. [2021-01-07 04:40:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:10,935 INFO L93 Difference]: Finished difference Result 1989 states and 2411 transitions. [2021-01-07 04:40:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 04:40:10,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 377 [2021-01-07 04:40:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:10,942 INFO L225 Difference]: With dead ends: 1989 [2021-01-07 04:40:10,942 INFO L226 Difference]: Without dead ends: 1029 [2021-01-07 04:40:10,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 04:40:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-01-07 04:40:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2021-01-07 04:40:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2021-01-07 04:40:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1236 transitions. [2021-01-07 04:40:10,990 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1236 transitions. Word has length 377 [2021-01-07 04:40:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:10,990 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1236 transitions. [2021-01-07 04:40:10,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 04:40:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1236 transitions. [2021-01-07 04:40:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2021-01-07 04:40:10,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:10,994 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:11,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:11,209 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1700907916, now seen corresponding path program 2 times [2021-01-07 04:40:11,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:11,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216877586] [2021-01-07 04:40:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:11,238 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:11,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377910825] [2021-01-07 04:40:11,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:12,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 04:40:12,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 04:40:12,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 04:40:12,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 04:40:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 73 proven. 21 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-01-07 04:40:12,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216877586] [2021-01-07 04:40:12,526 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 04:40:12,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377910825] [2021-01-07 04:40:12,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-07 04:40:12,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-01-07 04:40:12,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198380247] [2021-01-07 04:40:12,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 04:40:12,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 04:40:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 04:40:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:40:12,529 INFO L87 Difference]: Start difference. First operand 1029 states and 1236 transitions. Second operand 9 states. [2021-01-07 04:40:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 04:40:12,686 INFO L93 Difference]: Finished difference Result 2016 states and 2438 transitions. [2021-01-07 04:40:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 04:40:12,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2021-01-07 04:40:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 04:40:12,692 INFO L225 Difference]: With dead ends: 2016 [2021-01-07 04:40:12,692 INFO L226 Difference]: Without dead ends: 1043 [2021-01-07 04:40:12,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 04:40:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-01-07 04:40:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2021-01-07 04:40:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2021-01-07 04:40:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1250 transitions. [2021-01-07 04:40:12,736 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1250 transitions. Word has length 381 [2021-01-07 04:40:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 04:40:12,737 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1250 transitions. [2021-01-07 04:40:12,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 04:40:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1250 transitions. [2021-01-07 04:40:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-01-07 04:40:12,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 04:40:12,741 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 04:40:12,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 04:40:12,957 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 04:40:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 04:40:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -336611150, now seen corresponding path program 3 times [2021-01-07 04:40:12,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 04:40:12,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869538970] [2021-01-07 04:40:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 04:40:12,998 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 04:40:12,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724206517] [2021-01-07 04:40:12,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true