/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_FNV_test10-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 16:01:09,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 16:01:09,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 16:01:09,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 16:01:09,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 16:01:09,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 16:01:09,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 16:01:09,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 16:01:09,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 16:01:09,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 16:01:09,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 16:01:09,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 16:01:09,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 16:01:09,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 16:01:09,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 16:01:09,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 16:01:09,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 16:01:09,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 16:01:09,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 16:01:09,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 16:01:09,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 16:01:09,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 16:01:09,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 16:01:09,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 16:01:09,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 16:01:09,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 16:01:09,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 16:01:09,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 16:01:09,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 16:01:09,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 16:01:09,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 16:01:09,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 16:01:09,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 16:01:09,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 16:01:09,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 16:01:09,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 16:01:09,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 16:01:09,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 16:01:09,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 16:01:09,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 16:01:09,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 16:01:09,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 16:01:09,615 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 16:01:09,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 16:01:09,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 16:01:09,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 16:01:09,621 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 16:01:09,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 16:01:09,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 16:01:09,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 16:01:09,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 16:01:09,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 16:01:09,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 16:01:09,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 16:01:09,624 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 16:01:09,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 16:01:09,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 16:01:09,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 16:01:09,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 16:01:09,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:01:09,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 16:01:09,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 16:01:09,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 16:01:09,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 16:01:09,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 16:01:09,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 16:01:09,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 16:01:09,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 16:01:10,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 16:01:10,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 16:01:10,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 16:01:10,139 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 16:01:10,141 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 16:01:10,142 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_FNV_test10-3.i [2020-12-23 16:01:10,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d39767487/41cfa869f72242999f1cb52f33585cae/FLAGe59ed9ff6 [2020-12-23 16:01:11,115 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 16:01:11,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-3.i [2020-12-23 16:01:11,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d39767487/41cfa869f72242999f1cb52f33585cae/FLAGe59ed9ff6 [2020-12-23 16:01:11,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d39767487/41cfa869f72242999f1cb52f33585cae [2020-12-23 16:01:11,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 16:01:11,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 16:01:11,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 16:01:11,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 16:01:11,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 16:01:11,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:01:11" (1/1) ... [2020-12-23 16:01:11,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea96e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:11, skipping insertion in model container [2020-12-23 16:01:11,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:01:11" (1/1) ... [2020-12-23 16:01:11,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 16:01:11,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 16:01:11,949 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_FNV_test10-3.i[33022,33035] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem37,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem37,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem38,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem38,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem39,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem39,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem40,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem40,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem41,],base],StructAccessExpression[IdentifierExpression[#t~mem41,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem56,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem56,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem57,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem57,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem69,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem69,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem81,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem81,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem91,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem91,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem117,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem117,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem125,],base],StructAccessExpression[IdentifierExpression[#t~mem125,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem165,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem165,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem166,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem166,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem167,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem167,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem168,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem168,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,],base],StructAccessExpression[IdentifierExpression[#t~mem169,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem171,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem171,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem184,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem184,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem185,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem185,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem197,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem197,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem209,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem209,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem245,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem245,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem253,],base],StructAccessExpression[IdentifierExpression[#t~mem253,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem254,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem254,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem264,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem264,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem449,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem449,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem454,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem454,],offset],IdentifierExpression[#t~mem456,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem460,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem460,],offset],IdentifierExpression[#t~mem462,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem474,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem474,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem477,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem477,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem490,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem490,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem495,],offset],IdentifierExpression[#t~mem497,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem501,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem501,],offset],IdentifierExpression[#t~mem503,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem515,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem515,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem518,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem518,],offset]]]] [2020-12-23 16:01:12,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:01:12,473 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 16:01:12,548 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_FNV_test10-3.i[33022,33035] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],StructAccessExpression[IdentifierExpression[~user~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem43,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem43,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem44,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem44,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem45,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem45,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem46,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem46,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem47,],base],StructAccessExpression[IdentifierExpression[#t~mem47,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem49,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem49,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem62,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem62,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem63,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem63,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~0,],base],StructAccessExpression[IdentifierExpression[~_ha_head~0,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem89,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem89,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem99,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem99,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem126,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem126,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem134,],base],StructAccessExpression[IdentifierExpression[#t~mem134,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem136,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem136,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem146,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem146,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem175,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem175,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem176,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem176,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem177,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem178,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[#t~mem178,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem179,],base],StructAccessExpression[IdentifierExpression[#t~mem179,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem181,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[#t~mem181,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~altusers~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem194,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem194,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem195,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem195,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_ha_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~user~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~user~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem207,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem207,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_ha_head~1,],base],StructAccessExpression[IdentifierExpression[~_ha_head~1,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~#_he_new_buckets~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem221,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem221,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem231,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[#t~mem231,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt_i~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_hh_nxt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~_he_newbkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_thh~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~_he_thh~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem258,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem258,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],base],StructAccessExpression[IdentifierExpression[~_he_newbkt~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~_he_thh~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem266,],base],StructAccessExpression[IdentifierExpression[#t~mem266,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem268,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[#t~mem268,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem278,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[#t~mem278,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~0,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~1,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#i~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~2,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~4,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_hashv~3,] left hand side expression in assignment: lhs: VariableLHS[~_hj_j~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_i~5,] left hand side expression in assignment: lhs: VariableLHS[~_hj_k~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~_hf_bkt~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~user~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~usertmp~0,] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem467,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem467,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem472,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem472,],offset],IdentifierExpression[#t~mem474,]]]]] left hand side expression in assignment: lhs: VariableLHS[~users~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem478,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem478,],offset],IdentifierExpression[#t~mem480,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~0,],base],StructAccessExpression[IdentifierExpression[~_hd_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem492,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem492,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem495,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem495,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem508,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[#t~mem508,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem513,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem513,],offset],IdentifierExpression[#t~mem515,]]]]] left hand side expression in assignment: lhs: VariableLHS[~userstmp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem519,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem519,],offset],IdentifierExpression[#t~mem521,]]]]] left hand side expression in assignment: lhs: VariableLHS[~_hd_bkt~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~_hd_head~1,],base],StructAccessExpression[IdentifierExpression[~_hd_head~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem533,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[#t~mem533,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem536,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem536,],offset]]]] [2020-12-23 16:01:12,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 16:01:12,780 INFO L208 MainTranslator]: Completed translation [2020-12-23 16:01:12,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12 WrapperNode [2020-12-23 16:01:12,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 16:01:12,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 16:01:12,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 16:01:12,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 16:01:12,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:12,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 16:01:13,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 16:01:13,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 16:01:13,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 16:01:13,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... [2020-12-23 16:01:13,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 16:01:13,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 16:01:13,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 16:01:13,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 16:01:13,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 16:01:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 16:01:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 16:01:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 16:01:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 16:01:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 16:01:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-23 16:01:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 16:01:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 16:01:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 16:01:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 16:01:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 16:01:17,358 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 16:01:17,359 INFO L299 CfgBuilder]: Removed 224 assume(true) statements. [2020-12-23 16:01:17,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:01:17 BoogieIcfgContainer [2020-12-23 16:01:17,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 16:01:17,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 16:01:17,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 16:01:17,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 16:01:17,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:01:11" (1/3) ... [2020-12-23 16:01:17,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037a57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:01:17, skipping insertion in model container [2020-12-23 16:01:17,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:01:12" (2/3) ... [2020-12-23 16:01:17,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3037a57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:01:17, skipping insertion in model container [2020-12-23 16:01:17,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:01:17" (3/3) ... [2020-12-23 16:01:17,376 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-3.i [2020-12-23 16:01:17,384 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 16:01:17,391 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-12-23 16:01:17,414 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-12-23 16:01:17,470 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 16:01:17,471 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 16:01:17,471 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 16:01:17,471 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 16:01:17,471 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 16:01:17,471 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 16:01:17,471 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 16:01:17,472 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 16:01:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states. [2020-12-23 16:01:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 16:01:17,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:17,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:17,529 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -128377380, now seen corresponding path program 1 times [2020-12-23 16:01:17,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:17,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452157529] [2020-12-23 16:01:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:17,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452157529] [2020-12-23 16:01:17,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:17,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 16:01:17,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113550502] [2020-12-23 16:01:17,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 16:01:17,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 16:01:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:01:17,768 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 2 states. [2020-12-23 16:01:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:17,853 INFO L93 Difference]: Finished difference Result 1038 states and 1752 transitions. [2020-12-23 16:01:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 16:01:17,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-12-23 16:01:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:17,873 INFO L225 Difference]: With dead ends: 1038 [2020-12-23 16:01:17,874 INFO L226 Difference]: Without dead ends: 465 [2020-12-23 16:01:17,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 16:01:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-12-23 16:01:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2020-12-23 16:01:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-12-23 16:01:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 608 transitions. [2020-12-23 16:01:17,957 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 608 transitions. Word has length 9 [2020-12-23 16:01:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:17,958 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 608 transitions. [2020-12-23 16:01:17,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 16:01:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 608 transitions. [2020-12-23 16:01:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 16:01:17,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:17,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:17,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 16:01:17,962 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:17,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1568739198, now seen corresponding path program 1 times [2020-12-23 16:01:17,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:17,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126242021] [2020-12-23 16:01:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:18,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126242021] [2020-12-23 16:01:18,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:18,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:18,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21333964] [2020-12-23 16:01:18,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:18,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:18,090 INFO L87 Difference]: Start difference. First operand 465 states and 608 transitions. Second operand 4 states. [2020-12-23 16:01:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:19,117 INFO L93 Difference]: Finished difference Result 831 states and 1087 transitions. [2020-12-23 16:01:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:19,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 16:01:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:19,122 INFO L225 Difference]: With dead ends: 831 [2020-12-23 16:01:19,122 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 16:01:19,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 16:01:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 467. [2020-12-23 16:01:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-12-23 16:01:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 610 transitions. [2020-12-23 16:01:19,150 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 610 transitions. Word has length 44 [2020-12-23 16:01:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:19,150 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 610 transitions. [2020-12-23 16:01:19,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 610 transitions. [2020-12-23 16:01:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:01:19,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:19,155 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:19,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 16:01:19,156 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1325558428, now seen corresponding path program 1 times [2020-12-23 16:01:19,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:19,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323805171] [2020-12-23 16:01:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:19,194 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:19,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737356388] [2020-12-23 16:01:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:19,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:19,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:19,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323805171] [2020-12-23 16:01:19,737 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:19,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737356388] [2020-12-23 16:01:19,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:19,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:19,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790781647] [2020-12-23 16:01:19,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:19,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:19,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:19,742 INFO L87 Difference]: Start difference. First operand 467 states and 610 transitions. Second operand 3 states. [2020-12-23 16:01:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:19,990 INFO L93 Difference]: Finished difference Result 951 states and 1247 transitions. [2020-12-23 16:01:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:19,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:01:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:19,994 INFO L225 Difference]: With dead ends: 951 [2020-12-23 16:01:19,995 INFO L226 Difference]: Without dead ends: 488 [2020-12-23 16:01:19,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-23 16:01:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2020-12-23 16:01:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-23 16:01:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 630 transitions. [2020-12-23 16:01:20,019 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 630 transitions. Word has length 97 [2020-12-23 16:01:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:20,020 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 630 transitions. [2020-12-23 16:01:20,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 630 transitions. [2020-12-23 16:01:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:01:20,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:20,033 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:20,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 16:01:20,249 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 948433376, now seen corresponding path program 1 times [2020-12-23 16:01:20,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:20,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678518623] [2020-12-23 16:01:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:20,315 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:20,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063955795] [2020-12-23 16:01:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:20,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:20,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:01:20,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678518623] [2020-12-23 16:01:20,865 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:20,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063955795] [2020-12-23 16:01:20,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:20,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:20,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815859672] [2020-12-23 16:01:20,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:20,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:20,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:20,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:20,868 INFO L87 Difference]: Start difference. First operand 487 states and 630 transitions. Second operand 3 states. [2020-12-23 16:01:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:20,967 INFO L93 Difference]: Finished difference Result 787 states and 1024 transitions. [2020-12-23 16:01:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:20,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:01:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:20,971 INFO L225 Difference]: With dead ends: 787 [2020-12-23 16:01:20,971 INFO L226 Difference]: Without dead ends: 508 [2020-12-23 16:01:20,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-12-23 16:01:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2020-12-23 16:01:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-23 16:01:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 650 transitions. [2020-12-23 16:01:20,986 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 650 transitions. Word has length 97 [2020-12-23 16:01:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:20,987 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 650 transitions. [2020-12-23 16:01:20,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 650 transitions. [2020-12-23 16:01:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:01:20,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:20,989 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:21,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:21,203 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1352389214, now seen corresponding path program 1 times [2020-12-23 16:01:21,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:21,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616295810] [2020-12-23 16:01:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:21,229 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:21,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648278314] [2020-12-23 16:01:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:21,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:21,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:21,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616295810] [2020-12-23 16:01:21,786 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:21,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648278314] [2020-12-23 16:01:21,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:21,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:21,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246112213] [2020-12-23 16:01:21,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:21,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:21,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:21,792 INFO L87 Difference]: Start difference. First operand 507 states and 650 transitions. Second operand 4 states. [2020-12-23 16:01:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:21,931 INFO L93 Difference]: Finished difference Result 1086 states and 1400 transitions. [2020-12-23 16:01:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:21,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 16:01:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:21,936 INFO L225 Difference]: With dead ends: 1086 [2020-12-23 16:01:21,936 INFO L226 Difference]: Without dead ends: 583 [2020-12-23 16:01:21,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-12-23 16:01:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 493. [2020-12-23 16:01:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-12-23 16:01:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 629 transitions. [2020-12-23 16:01:21,955 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 629 transitions. Word has length 97 [2020-12-23 16:01:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:21,955 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 629 transitions. [2020-12-23 16:01:21,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 629 transitions. [2020-12-23 16:01:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:01:21,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:21,958 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:22,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:22,172 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 881478960, now seen corresponding path program 1 times [2020-12-23 16:01:22,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:22,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460113966] [2020-12-23 16:01:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:22,228 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:22,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478147139] [2020-12-23 16:01:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:22,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:22,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 16:01:22,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460113966] [2020-12-23 16:01:22,695 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:22,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478147139] [2020-12-23 16:01:22,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:22,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:22,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598070856] [2020-12-23 16:01:22,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:22,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:22,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:22,698 INFO L87 Difference]: Start difference. First operand 493 states and 629 transitions. Second operand 4 states. [2020-12-23 16:01:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:22,813 INFO L93 Difference]: Finished difference Result 761 states and 972 transitions. [2020-12-23 16:01:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:22,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 16:01:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:22,817 INFO L225 Difference]: With dead ends: 761 [2020-12-23 16:01:22,818 INFO L226 Difference]: Without dead ends: 480 [2020-12-23 16:01:22,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-23 16:01:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2020-12-23 16:01:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-12-23 16:01:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 608 transitions. [2020-12-23 16:01:22,833 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 608 transitions. Word has length 97 [2020-12-23 16:01:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:22,834 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 608 transitions. [2020-12-23 16:01:22,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 608 transitions. [2020-12-23 16:01:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 16:01:22,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:22,835 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:23,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:23,051 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1427704734, now seen corresponding path program 1 times [2020-12-23 16:01:23,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:23,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277708375] [2020-12-23 16:01:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:23,075 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:23,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263394898] [2020-12-23 16:01:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:23,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:01:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:23,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277708375] [2020-12-23 16:01:23,589 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:23,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263394898] [2020-12-23 16:01:23,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:23,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:23,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867522741] [2020-12-23 16:01:23,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:23,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:23,591 INFO L87 Difference]: Start difference. First operand 479 states and 608 transitions. Second operand 3 states. [2020-12-23 16:01:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:23,714 INFO L93 Difference]: Finished difference Result 1231 states and 1562 transitions. [2020-12-23 16:01:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:23,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2020-12-23 16:01:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:23,719 INFO L225 Difference]: With dead ends: 1231 [2020-12-23 16:01:23,720 INFO L226 Difference]: Without dead ends: 756 [2020-12-23 16:01:23,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-12-23 16:01:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 721. [2020-12-23 16:01:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2020-12-23 16:01:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2020-12-23 16:01:23,744 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 97 [2020-12-23 16:01:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:23,745 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2020-12-23 16:01:23,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2020-12-23 16:01:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 16:01:23,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:23,747 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:23,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 16:01:23,961 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -371205377, now seen corresponding path program 1 times [2020-12-23 16:01:23,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:23,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269203097] [2020-12-23 16:01:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:23,986 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:23,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549685128] [2020-12-23 16:01:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:24,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:24,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 16:01:24,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269203097] [2020-12-23 16:01:24,495 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:24,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549685128] [2020-12-23 16:01:24,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:24,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:24,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108059193] [2020-12-23 16:01:24,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:24,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:24,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:24,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:24,498 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 3 states. [2020-12-23 16:01:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:24,567 INFO L93 Difference]: Finished difference Result 1400 states and 1809 transitions. [2020-12-23 16:01:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:24,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 16:01:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:24,572 INFO L225 Difference]: With dead ends: 1400 [2020-12-23 16:01:24,573 INFO L226 Difference]: Without dead ends: 727 [2020-12-23 16:01:24,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2020-12-23 16:01:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2020-12-23 16:01:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2020-12-23 16:01:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 936 transitions. [2020-12-23 16:01:24,600 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 936 transitions. Word has length 104 [2020-12-23 16:01:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:24,601 INFO L481 AbstractCegarLoop]: Abstraction has 727 states and 936 transitions. [2020-12-23 16:01:24,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 936 transitions. [2020-12-23 16:01:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 16:01:24,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:24,603 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:24,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:24,818 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2085853600, now seen corresponding path program 1 times [2020-12-23 16:01:24,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:24,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964860929] [2020-12-23 16:01:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:24,857 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:24,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849527380] [2020-12-23 16:01:24,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:25,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:01:25,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 16:01:25,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964860929] [2020-12-23 16:01:25,409 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:25,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849527380] [2020-12-23 16:01:25,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:25,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-12-23 16:01:25,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238227607] [2020-12-23 16:01:25,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:25,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:25,414 INFO L87 Difference]: Start difference. First operand 727 states and 936 transitions. Second operand 4 states. [2020-12-23 16:01:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:25,507 INFO L93 Difference]: Finished difference Result 1411 states and 1820 transitions. [2020-12-23 16:01:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:25,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 16:01:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:25,512 INFO L225 Difference]: With dead ends: 1411 [2020-12-23 16:01:25,512 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 16:01:25,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 16:01:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 16:01:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 16:01:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 942 transitions. [2020-12-23 16:01:25,536 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 942 transitions. Word has length 106 [2020-12-23 16:01:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:25,537 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 942 transitions. [2020-12-23 16:01:25,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 942 transitions. [2020-12-23 16:01:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 16:01:25,539 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:25,539 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:25,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:25,755 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:25,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -462744993, now seen corresponding path program 2 times [2020-12-23 16:01:25,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:25,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100338479] [2020-12-23 16:01:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:25,775 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:25,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249723995] [2020-12-23 16:01:25,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:27,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:01:27,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:27,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:01:27,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 16:01:27,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100338479] [2020-12-23 16:01:27,142 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:27,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249723995] [2020-12-23 16:01:27,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:27,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-12-23 16:01:27,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097343913] [2020-12-23 16:01:27,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:01:27,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:27,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:01:27,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:27,144 INFO L87 Difference]: Start difference. First operand 733 states and 942 transitions. Second operand 5 states. [2020-12-23 16:01:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:27,267 INFO L93 Difference]: Finished difference Result 1422 states and 1831 transitions. [2020-12-23 16:01:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:01:27,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-12-23 16:01:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:27,272 INFO L225 Difference]: With dead ends: 1422 [2020-12-23 16:01:27,272 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:01:27,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:01:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:01:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:01:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2020-12-23 16:01:27,295 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 108 [2020-12-23 16:01:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:27,296 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2020-12-23 16:01:27,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:01:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2020-12-23 16:01:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 16:01:27,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:27,298 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:27,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 16:01:27,504 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash 87417216, now seen corresponding path program 3 times [2020-12-23 16:01:27,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:27,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449346397] [2020-12-23 16:01:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:27,524 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:27,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72853827] [2020-12-23 16:01:27,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:28,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:01:28,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:28,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:01:28,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:28,431 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-23 16:01:28,433 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:01:28,443 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-12-23 16:01:28,444 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,450 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:01:28,451 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,451 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2020-12-23 16:01:28,482 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:01:28,483 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-12-23 16:01:28,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 16:01:28,496 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:01:28,501 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-12-23 16:01:28,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 16:01:28,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-12-23 16:01:28,566 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 16:01:28,574 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 16:01:28,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:3 [2020-12-23 16:01:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:01:28,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449346397] [2020-12-23 16:01:28,659 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:28,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72853827] [2020-12-23 16:01:28,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:28,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:01:28,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768976755] [2020-12-23 16:01:28,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:01:28,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:01:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:28,667 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 5 states. [2020-12-23 16:01:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:29,809 INFO L93 Difference]: Finished difference Result 1382 states and 1772 transitions. [2020-12-23 16:01:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:01:29,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2020-12-23 16:01:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:29,813 INFO L225 Difference]: With dead ends: 1382 [2020-12-23 16:01:29,814 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:01:29,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:01:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:01:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:01:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:01:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2020-12-23 16:01:29,844 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 110 [2020-12-23 16:01:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:29,844 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2020-12-23 16:01:29,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:01:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2020-12-23 16:01:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:01:29,847 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:29,848 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:30,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:30,056 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2117457625, now seen corresponding path program 1 times [2020-12-23 16:01:30,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:30,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653204256] [2020-12-23 16:01:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:30,085 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:30,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129200550] [2020-12-23 16:01:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:30,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:30,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:01:30,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653204256] [2020-12-23 16:01:30,668 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:30,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129200550] [2020-12-23 16:01:30,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:30,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:30,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792947876] [2020-12-23 16:01:30,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:30,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:30,670 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand 3 states. [2020-12-23 16:01:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:30,791 INFO L93 Difference]: Finished difference Result 1502 states and 1935 transitions. [2020-12-23 16:01:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:30,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-12-23 16:01:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:30,795 INFO L225 Difference]: With dead ends: 1502 [2020-12-23 16:01:30,796 INFO L226 Difference]: Without dead ends: 781 [2020-12-23 16:01:30,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2020-12-23 16:01:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2020-12-23 16:01:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-12-23 16:01:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 987 transitions. [2020-12-23 16:01:30,821 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 987 transitions. Word has length 157 [2020-12-23 16:01:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:30,821 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 987 transitions. [2020-12-23 16:01:30,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 987 transitions. [2020-12-23 16:01:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:01:30,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:30,824 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:31,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:31,038 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1572585051, now seen corresponding path program 1 times [2020-12-23 16:01:31,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:31,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115202353] [2020-12-23 16:01:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:31,066 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:31,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695670125] [2020-12-23 16:01:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:31,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 16:01:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:01:31,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115202353] [2020-12-23 16:01:31,687 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:31,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695670125] [2020-12-23 16:01:31,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:31,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:31,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410839105] [2020-12-23 16:01:31,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:31,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:31,690 INFO L87 Difference]: Start difference. First operand 779 states and 987 transitions. Second operand 4 states. [2020-12-23 16:01:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:31,791 INFO L93 Difference]: Finished difference Result 1496 states and 1900 transitions. [2020-12-23 16:01:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:31,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 16:01:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:31,795 INFO L225 Difference]: With dead ends: 1496 [2020-12-23 16:01:31,795 INFO L226 Difference]: Without dead ends: 753 [2020-12-23 16:01:31,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-12-23 16:01:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2020-12-23 16:01:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2020-12-23 16:01:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 945 transitions. [2020-12-23 16:01:31,820 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 945 transitions. Word has length 157 [2020-12-23 16:01:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:31,820 INFO L481 AbstractCegarLoop]: Abstraction has 751 states and 945 transitions. [2020-12-23 16:01:31,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 945 transitions. [2020-12-23 16:01:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:01:31,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:31,823 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:32,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 16:01:32,037 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:32,038 INFO L82 PathProgramCache]: Analyzing trace with hash 94293941, now seen corresponding path program 1 times [2020-12-23 16:01:32,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:32,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630397481] [2020-12-23 16:01:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:32,060 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:32,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262281894] [2020-12-23 16:01:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:32,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:01:32,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:01:32,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630397481] [2020-12-23 16:01:32,723 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:32,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262281894] [2020-12-23 16:01:32,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:32,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 16:01:32,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464959482] [2020-12-23 16:01:32,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 16:01:32,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 16:01:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:32,725 INFO L87 Difference]: Start difference. First operand 751 states and 945 transitions. Second operand 5 states. [2020-12-23 16:01:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:32,900 INFO L93 Difference]: Finished difference Result 2209 states and 2786 transitions. [2020-12-23 16:01:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 16:01:32,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-12-23 16:01:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:32,909 INFO L225 Difference]: With dead ends: 2209 [2020-12-23 16:01:32,909 INFO L226 Difference]: Without dead ends: 1496 [2020-12-23 16:01:32,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-12-23 16:01:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 797. [2020-12-23 16:01:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-12-23 16:01:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 995 transitions. [2020-12-23 16:01:32,945 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 995 transitions. Word has length 157 [2020-12-23 16:01:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:32,945 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 995 transitions. [2020-12-23 16:01:32,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 16:01:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 995 transitions. [2020-12-23 16:01:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:01:32,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:32,948 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:33,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 16:01:33,164 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:33,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1994860229, now seen corresponding path program 1 times [2020-12-23 16:01:33,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:33,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089724162] [2020-12-23 16:01:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:33,187 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:33,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158209671] [2020-12-23 16:01:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:33,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 16:01:33,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 16:01:33,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089724162] [2020-12-23 16:01:33,756 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:33,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158209671] [2020-12-23 16:01:33,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:33,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:33,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291879872] [2020-12-23 16:01:33,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:33,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:33,758 INFO L87 Difference]: Start difference. First operand 797 states and 995 transitions. Second operand 4 states. [2020-12-23 16:01:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:33,832 INFO L93 Difference]: Finished difference Result 1503 states and 1887 transitions. [2020-12-23 16:01:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:33,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2020-12-23 16:01:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:33,837 INFO L225 Difference]: With dead ends: 1503 [2020-12-23 16:01:33,837 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 16:01:33,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 16:01:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2020-12-23 16:01:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2020-12-23 16:01:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2020-12-23 16:01:33,866 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 157 [2020-12-23 16:01:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:33,867 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2020-12-23 16:01:33,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2020-12-23 16:01:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-12-23 16:01:33,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:33,869 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:34,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 16:01:34,083 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 639166515, now seen corresponding path program 1 times [2020-12-23 16:01:34,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:34,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383820102] [2020-12-23 16:01:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:34,101 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:34,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656393341] [2020-12-23 16:01:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:34,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 16:01:34,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 16:01:34,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383820102] [2020-12-23 16:01:34,750 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:34,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656393341] [2020-12-23 16:01:34,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:34,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-12-23 16:01:34,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715791356] [2020-12-23 16:01:34,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 16:01:34,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:34,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 16:01:34,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:01:34,753 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 6 states. [2020-12-23 16:01:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:34,856 INFO L93 Difference]: Finished difference Result 1424 states and 1796 transitions. [2020-12-23 16:01:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 16:01:34,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2020-12-23 16:01:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:34,861 INFO L225 Difference]: With dead ends: 1424 [2020-12-23 16:01:34,861 INFO L226 Difference]: Without dead ends: 739 [2020-12-23 16:01:34,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-23 16:01:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2020-12-23 16:01:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2020-12-23 16:01:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-12-23 16:01:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 923 transitions. [2020-12-23 16:01:34,887 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 923 transitions. Word has length 157 [2020-12-23 16:01:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:34,888 INFO L481 AbstractCegarLoop]: Abstraction has 739 states and 923 transitions. [2020-12-23 16:01:34,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 16:01:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 923 transitions. [2020-12-23 16:01:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 16:01:34,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:34,890 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:35,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:35,105 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1050888114, now seen corresponding path program 2 times [2020-12-23 16:01:35,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:35,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115954894] [2020-12-23 16:01:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:35,128 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:35,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553849456] [2020-12-23 16:01:35,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:35,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:01:35,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:35,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 16:01:35,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 16:01:35,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115954894] [2020-12-23 16:01:35,900 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:35,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553849456] [2020-12-23 16:01:35,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:35,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-23 16:01:35,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944927751] [2020-12-23 16:01:35,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 16:01:35,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 16:01:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:01:35,903 INFO L87 Difference]: Start difference. First operand 739 states and 923 transitions. Second operand 7 states. [2020-12-23 16:01:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:36,050 INFO L93 Difference]: Finished difference Result 1435 states and 1807 transitions. [2020-12-23 16:01:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 16:01:36,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2020-12-23 16:01:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:36,055 INFO L225 Difference]: With dead ends: 1435 [2020-12-23 16:01:36,055 INFO L226 Difference]: Without dead ends: 745 [2020-12-23 16:01:36,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 16:01:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2020-12-23 16:01:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2020-12-23 16:01:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-12-23 16:01:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 929 transitions. [2020-12-23 16:01:36,090 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 929 transitions. Word has length 159 [2020-12-23 16:01:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:36,091 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 929 transitions. [2020-12-23 16:01:36,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 16:01:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 929 transitions. [2020-12-23 16:01:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 16:01:36,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:36,094 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:36,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 16:01:36,308 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 770488787, now seen corresponding path program 3 times [2020-12-23 16:01:36,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:36,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968149002] [2020-12-23 16:01:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:36,333 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:36,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493893953] [2020-12-23 16:01:36,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:36,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:01:36,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:36,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 16:01:36,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 16:01:37,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968149002] [2020-12-23 16:01:37,050 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:37,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493893953] [2020-12-23 16:01:37,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:37,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 16:01:37,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221625695] [2020-12-23 16:01:37,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 16:01:37,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 16:01:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:37,052 INFO L87 Difference]: Start difference. First operand 745 states and 929 transitions. Second operand 3 states. [2020-12-23 16:01:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:37,158 INFO L93 Difference]: Finished difference Result 1749 states and 2217 transitions. [2020-12-23 16:01:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 16:01:37,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2020-12-23 16:01:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:37,165 INFO L225 Difference]: With dead ends: 1749 [2020-12-23 16:01:37,165 INFO L226 Difference]: Without dead ends: 1063 [2020-12-23 16:01:37,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 16:01:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-12-23 16:01:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 906. [2020-12-23 16:01:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2020-12-23 16:01:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1156 transitions. [2020-12-23 16:01:37,242 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1156 transitions. Word has length 161 [2020-12-23 16:01:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:37,242 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1156 transitions. [2020-12-23 16:01:37,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 16:01:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1156 transitions. [2020-12-23 16:01:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 16:01:37,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:37,250 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:37,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 16:01:37,459 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1484056676, now seen corresponding path program 1 times [2020-12-23 16:01:37,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:37,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373008903] [2020-12-23 16:01:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:37,478 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:37,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684060019] [2020-12-23 16:01:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:37,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 16:01:37,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-12-23 16:01:38,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373008903] [2020-12-23 16:01:38,199 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:38,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684060019] [2020-12-23 16:01:38,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:38,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-12-23 16:01:38,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921661230] [2020-12-23 16:01:38,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 16:01:38,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 16:01:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:01:38,202 INFO L87 Difference]: Start difference. First operand 906 states and 1156 transitions. Second operand 8 states. [2020-12-23 16:01:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:38,342 INFO L93 Difference]: Finished difference Result 1770 states and 2275 transitions. [2020-12-23 16:01:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 16:01:38,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2020-12-23 16:01:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:38,348 INFO L225 Difference]: With dead ends: 1770 [2020-12-23 16:01:38,348 INFO L226 Difference]: Without dead ends: 912 [2020-12-23 16:01:38,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 16:01:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2020-12-23 16:01:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2020-12-23 16:01:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2020-12-23 16:01:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1162 transitions. [2020-12-23 16:01:38,388 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1162 transitions. Word has length 178 [2020-12-23 16:01:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:38,389 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1162 transitions. [2020-12-23 16:01:38,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 16:01:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1162 transitions. [2020-12-23 16:01:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 16:01:38,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:38,392 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:38,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:38,607 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:38,608 INFO L82 PathProgramCache]: Analyzing trace with hash -453644734, now seen corresponding path program 2 times [2020-12-23 16:01:38,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:38,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635695331] [2020-12-23 16:01:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:38,633 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:38,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87852298] [2020-12-23 16:01:38,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:39,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:01:39,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:39,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:01:39,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-12-23 16:01:39,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635695331] [2020-12-23 16:01:39,440 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:39,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87852298] [2020-12-23 16:01:39,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:39,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-23 16:01:39,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116674684] [2020-12-23 16:01:39,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 16:01:39,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 16:01:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:01:39,442 INFO L87 Difference]: Start difference. First operand 912 states and 1162 transitions. Second operand 9 states. [2020-12-23 16:01:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:39,600 INFO L93 Difference]: Finished difference Result 1781 states and 2286 transitions. [2020-12-23 16:01:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 16:01:39,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2020-12-23 16:01:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:39,606 INFO L225 Difference]: With dead ends: 1781 [2020-12-23 16:01:39,606 INFO L226 Difference]: Without dead ends: 918 [2020-12-23 16:01:39,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-23 16:01:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2020-12-23 16:01:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2020-12-23 16:01:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2020-12-23 16:01:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1168 transitions. [2020-12-23 16:01:39,644 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1168 transitions. Word has length 182 [2020-12-23 16:01:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:39,645 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 1168 transitions. [2020-12-23 16:01:39,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 16:01:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1168 transitions. [2020-12-23 16:01:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-12-23 16:01:39,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:39,647 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:39,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:39,861 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1986963428, now seen corresponding path program 3 times [2020-12-23 16:01:39,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:39,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942260607] [2020-12-23 16:01:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:39,882 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:39,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376505591] [2020-12-23 16:01:39,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:40,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-23 16:01:40,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:40,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 16:01:40,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-12-23 16:01:40,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942260607] [2020-12-23 16:01:40,763 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:40,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376505591] [2020-12-23 16:01:40,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 16:01:40,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 16:01:40,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753095787] [2020-12-23 16:01:40,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 16:01:40,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 16:01:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 16:01:40,765 INFO L87 Difference]: Start difference. First operand 918 states and 1168 transitions. Second operand 4 states. [2020-12-23 16:01:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:41,364 INFO L93 Difference]: Finished difference Result 1509 states and 1921 transitions. [2020-12-23 16:01:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 16:01:41,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-12-23 16:01:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:41,369 INFO L225 Difference]: With dead ends: 1509 [2020-12-23 16:01:41,369 INFO L226 Difference]: Without dead ends: 732 [2020-12-23 16:01:41,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 16:01:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-23 16:01:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-12-23 16:01:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-23 16:01:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 909 transitions. [2020-12-23 16:01:41,402 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 909 transitions. Word has length 186 [2020-12-23 16:01:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:41,403 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 909 transitions. [2020-12-23 16:01:41,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 16:01:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 909 transitions. [2020-12-23 16:01:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 16:01:41,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:41,405 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:41,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:41,619 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1622468887, now seen corresponding path program 1 times [2020-12-23 16:01:41,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:41,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126539091] [2020-12-23 16:01:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:41,643 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:41,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059687644] [2020-12-23 16:01:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 16:01:42,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 16:01:42,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-23 16:01:42,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126539091] [2020-12-23 16:01:42,452 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:42,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059687644] [2020-12-23 16:01:42,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:42,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-12-23 16:01:42,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827988251] [2020-12-23 16:01:42,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 16:01:42,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:42,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 16:01:42,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 16:01:42,454 INFO L87 Difference]: Start difference. First operand 732 states and 909 transitions. Second operand 10 states. [2020-12-23 16:01:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:42,618 INFO L93 Difference]: Finished difference Result 1418 states and 1775 transitions. [2020-12-23 16:01:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 16:01:42,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2020-12-23 16:01:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:42,627 INFO L225 Difference]: With dead ends: 1418 [2020-12-23 16:01:42,627 INFO L226 Difference]: Without dead ends: 736 [2020-12-23 16:01:42,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-23 16:01:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2020-12-23 16:01:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2020-12-23 16:01:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-12-23 16:01:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 913 transitions. [2020-12-23 16:01:42,662 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 913 transitions. Word has length 193 [2020-12-23 16:01:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:42,663 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 913 transitions. [2020-12-23 16:01:42,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 16:01:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 913 transitions. [2020-12-23 16:01:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-12-23 16:01:42,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:42,665 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:42,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 16:01:42,881 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1336921525, now seen corresponding path program 2 times [2020-12-23 16:01:42,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:42,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612108793] [2020-12-23 16:01:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:42,902 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:42,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427509710] [2020-12-23 16:01:42,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 16:01:43,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 16:01:43,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 16:01:43,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-23 16:01:43,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 16:01:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-12-23 16:01:44,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612108793] [2020-12-23 16:01:44,042 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-23 16:01:44,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427509710] [2020-12-23 16:01:44,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-23 16:01:44,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-12-23 16:01:44,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81337589] [2020-12-23 16:01:44,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 16:01:44,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 16:01:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 16:01:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:01:44,044 INFO L87 Difference]: Start difference. First operand 736 states and 913 transitions. Second operand 11 states. [2020-12-23 16:01:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 16:01:44,226 INFO L93 Difference]: Finished difference Result 1425 states and 1782 transitions. [2020-12-23 16:01:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 16:01:44,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2020-12-23 16:01:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 16:01:44,232 INFO L225 Difference]: With dead ends: 1425 [2020-12-23 16:01:44,232 INFO L226 Difference]: Without dead ends: 740 [2020-12-23 16:01:44,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-23 16:01:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2020-12-23 16:01:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2020-12-23 16:01:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-12-23 16:01:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 917 transitions. [2020-12-23 16:01:44,267 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 917 transitions. Word has length 197 [2020-12-23 16:01:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 16:01:44,268 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 917 transitions. [2020-12-23 16:01:44,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 16:01:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 917 transitions. [2020-12-23 16:01:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-23 16:01:44,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 16:01:44,270 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 16:01:44,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 16:01:44,477 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 16:01:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 16:01:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1628837737, now seen corresponding path program 3 times [2020-12-23 16:01:44,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 16:01:44,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311232952] [2020-12-23 16:01:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 16:01:44,498 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-23 16:01:44,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920155952] [2020-12-23 16:01:44,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true