/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/openssl/s3_srvr.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:45:04,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:45:04,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:45:04,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:45:04,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:45:04,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:45:04,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:45:04,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:45:04,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:45:04,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:45:04,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:45:04,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:45:04,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:45:04,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:45:04,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:45:04,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:45:04,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:45:04,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:45:04,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:45:04,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:45:04,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:45:04,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:45:04,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:45:04,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:45:04,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:45:04,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:45:04,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:45:04,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:45:04,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:45:04,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:45:04,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:45:04,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:45:04,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:45:04,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:45:04,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:45:04,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:45:04,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:45:04,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:45:04,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:45:04,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:45:04,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:45:04,349 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 01:45:04,381 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:45:04,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:45:04,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:45:04,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:45:04,383 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:45:04,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:45:04,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:45:04,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:45:04,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:45:04,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:45:04,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:45:04,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:45:04,385 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:45:04,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:45:04,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:45:04,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:45:04,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:45:04,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:45:04,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:45:04,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:45:04,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:45:04,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:45:04,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:45:04,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:45:04,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:45:04,388 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 01:45:04,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:45:04,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:45:04,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:45:04,797 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:45:04,798 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:45:04,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2020-12-23 01:45:04,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1742518a9/3edf8822c34646f69f68ce2dad24920a/FLAG3b73941b1 [2020-12-23 01:45:05,814 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:45:05,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2020-12-23 01:45:05,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1742518a9/3edf8822c34646f69f68ce2dad24920a/FLAG3b73941b1 [2020-12-23 01:45:06,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1742518a9/3edf8822c34646f69f68ce2dad24920a [2020-12-23 01:45:06,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:45:06,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:45:06,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:45:06,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:45:06,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:45:06,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:06,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76add1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06, skipping insertion in model container [2020-12-23 01:45:06,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:06,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:45:06,119 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem84,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem84,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem85,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem85,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem102,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem107,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem108,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem108,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem111,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem111,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem123,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem123,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem132,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem132,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:45:06,618 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/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:45:06,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:45:06,650 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem72,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem72,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem84,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem84,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem85,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem85,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem102,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem107,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem107,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem108,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem108,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem111,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem111,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem123,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem123,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem132,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem132,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:45:06,882 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/openssl/s3_srvr.blast.01.i.cil-2.c[71733,71746] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:45:06,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:45:06,917 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:45:06,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06 WrapperNode [2020-12-23 01:45:06,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:45:06,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:45:06,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:45:06,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:45:06,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:06,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:45:07,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:45:07,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:45:07,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:45:07,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (1/1) ... [2020-12-23 01:45:07,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:45:07,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:45:07,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:45:07,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:45:07,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (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 01:45:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:45:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:45:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:45:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:45:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:45:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:45:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:45:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:45:07,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:45:07,696 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:45:08,661 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:45:08,661 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:45:08,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:45:08,672 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:45:08,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:08 BoogieIcfgContainer [2020-12-23 01:45:08,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:45:08,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:45:08,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:45:08,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:45:08,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:45:06" (1/3) ... [2020-12-23 01:45:08,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccbd6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:08, skipping insertion in model container [2020-12-23 01:45:08,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:06" (2/3) ... [2020-12-23 01:45:08,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccbd6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:08, skipping insertion in model container [2020-12-23 01:45:08,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:08" (3/3) ... [2020-12-23 01:45:08,692 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2020-12-23 01:45:08,701 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:45:08,707 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:45:08,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:45:08,781 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:45:08,781 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:45:08,781 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:45:08,781 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:45:08,781 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:45:08,782 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:45:08,782 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:45:08,782 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:45:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2020-12-23 01:45:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:45:08,820 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:08,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:08,822 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2020-12-23 01:45:08,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:08,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117403030] [2020-12-23 01:45:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:09,254 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 01:45:09,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117403030] [2020-12-23 01:45:09,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:09,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:09,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814628806] [2020-12-23 01:45:09,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:09,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:09,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:09,289 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2020-12-23 01:45:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:09,887 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2020-12-23 01:45:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:09,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-23 01:45:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:09,903 INFO L225 Difference]: With dead ends: 317 [2020-12-23 01:45:09,903 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:45:09,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:45:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2020-12-23 01:45:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2020-12-23 01:45:09,981 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2020-12-23 01:45:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:09,981 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2020-12-23 01:45:09,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2020-12-23 01:45:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:45:09,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:09,991 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:09,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:45:09,992 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2020-12-23 01:45:09,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:09,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797052913] [2020-12-23 01:45:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:10,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797052913] [2020-12-23 01:45:10,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:10,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:10,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855141307] [2020-12-23 01:45:10,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:10,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:10,204 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2020-12-23 01:45:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:10,754 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2020-12-23 01:45:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:10,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:45:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:10,757 INFO L225 Difference]: With dead ends: 284 [2020-12-23 01:45:10,757 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:45:10,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:45:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2020-12-23 01:45:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2020-12-23 01:45:10,773 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2020-12-23 01:45:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:10,773 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2020-12-23 01:45:10,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2020-12-23 01:45:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:10,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:10,776 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:10,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:45:10,776 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2020-12-23 01:45:10,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:10,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815614028] [2020-12-23 01:45:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:10,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815614028] [2020-12-23 01:45:10,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:10,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:10,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313288023] [2020-12-23 01:45:10,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:10,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:10,945 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2020-12-23 01:45:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:11,366 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2020-12-23 01:45:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:11,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:11,369 INFO L225 Difference]: With dead ends: 282 [2020-12-23 01:45:11,370 INFO L226 Difference]: Without dead ends: 158 [2020-12-23 01:45:11,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-23 01:45:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2020-12-23 01:45:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2020-12-23 01:45:11,382 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2020-12-23 01:45:11,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:11,382 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2020-12-23 01:45:11,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2020-12-23 01:45:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:11,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:11,386 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:11,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:45:11,386 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2020-12-23 01:45:11,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:11,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193206733] [2020-12-23 01:45:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:11,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193206733] [2020-12-23 01:45:11,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:11,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:11,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391877757] [2020-12-23 01:45:11,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:11,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:11,543 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2020-12-23 01:45:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:11,960 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2020-12-23 01:45:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:11,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:11,964 INFO L225 Difference]: With dead ends: 281 [2020-12-23 01:45:11,964 INFO L226 Difference]: Without dead ends: 157 [2020-12-23 01:45:11,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-23 01:45:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2020-12-23 01:45:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2020-12-23 01:45:11,986 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2020-12-23 01:45:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:11,987 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2020-12-23 01:45:11,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2020-12-23 01:45:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 01:45:11,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:11,993 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:11,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:45:11,993 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2020-12-23 01:45:11,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:11,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19160744] [2020-12-23 01:45:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:12,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19160744] [2020-12-23 01:45:12,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:12,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:12,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424857047] [2020-12-23 01:45:12,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:12,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:12,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:12,130 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2020-12-23 01:45:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:12,480 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2020-12-23 01:45:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:12,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 01:45:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:12,482 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:45:12,482 INFO L226 Difference]: Without dead ends: 156 [2020-12-23 01:45:12,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:12,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-23 01:45:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2020-12-23 01:45:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2020-12-23 01:45:12,491 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2020-12-23 01:45:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:12,491 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2020-12-23 01:45:12,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2020-12-23 01:45:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 01:45:12,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:12,493 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] [2020-12-23 01:45:12,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:45:12,493 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2020-12-23 01:45:12,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:12,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412311213] [2020-12-23 01:45:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:12,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412311213] [2020-12-23 01:45:12,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:12,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:12,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568277632] [2020-12-23 01:45:12,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:12,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:12,577 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2020-12-23 01:45:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:12,923 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2020-12-23 01:45:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:12,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 01:45:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:12,925 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:45:12,925 INFO L226 Difference]: Without dead ends: 156 [2020-12-23 01:45:12,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-23 01:45:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2020-12-23 01:45:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2020-12-23 01:45:12,933 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2020-12-23 01:45:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:12,933 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2020-12-23 01:45:12,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2020-12-23 01:45:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:45:12,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:12,935 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:12,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:45:12,935 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2020-12-23 01:45:12,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:12,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108411529] [2020-12-23 01:45:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:13,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108411529] [2020-12-23 01:45:13,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:13,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:13,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394974440] [2020-12-23 01:45:13,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:13,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:13,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:13,004 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2020-12-23 01:45:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:13,345 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2020-12-23 01:45:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:13,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 01:45:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:13,347 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:45:13,347 INFO L226 Difference]: Without dead ends: 156 [2020-12-23 01:45:13,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-23 01:45:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2020-12-23 01:45:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2020-12-23 01:45:13,354 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2020-12-23 01:45:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:13,355 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2020-12-23 01:45:13,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2020-12-23 01:45:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:45:13,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:13,356 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:13,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:45:13,357 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2020-12-23 01:45:13,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:13,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178404438] [2020-12-23 01:45:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:13,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178404438] [2020-12-23 01:45:13,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:13,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:13,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103195645] [2020-12-23 01:45:13,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:13,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:13,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:13,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:13,419 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2020-12-23 01:45:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:13,766 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2020-12-23 01:45:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:13,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:45:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:13,768 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:45:13,768 INFO L226 Difference]: Without dead ends: 156 [2020-12-23 01:45:13,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-23 01:45:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2020-12-23 01:45:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:45:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2020-12-23 01:45:13,774 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2020-12-23 01:45:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:13,775 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2020-12-23 01:45:13,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2020-12-23 01:45:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:45:13,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:13,776 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:13,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:45:13,777 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2020-12-23 01:45:13,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:13,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192162106] [2020-12-23 01:45:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:13,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192162106] [2020-12-23 01:45:13,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:13,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:13,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711669070] [2020-12-23 01:45:13,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:13,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:13,847 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2020-12-23 01:45:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:14,211 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2020-12-23 01:45:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:14,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:45:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:14,213 INFO L225 Difference]: With dead ends: 310 [2020-12-23 01:45:14,213 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 01:45:14,214 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 01:45:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 01:45:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2020-12-23 01:45:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2020-12-23 01:45:14,221 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2020-12-23 01:45:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:14,221 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2020-12-23 01:45:14,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2020-12-23 01:45:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 01:45:14,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:14,223 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:14,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:45:14,223 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2020-12-23 01:45:14,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:14,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428350165] [2020-12-23 01:45:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:14,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428350165] [2020-12-23 01:45:14,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:14,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:14,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316523897] [2020-12-23 01:45:14,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:14,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:14,283 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2020-12-23 01:45:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:14,621 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2020-12-23 01:45:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:14,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-12-23 01:45:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:14,623 INFO L225 Difference]: With dead ends: 314 [2020-12-23 01:45:14,623 INFO L226 Difference]: Without dead ends: 168 [2020-12-23 01:45:14,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-12-23 01:45:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2020-12-23 01:45:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2020-12-23 01:45:14,630 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2020-12-23 01:45:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:14,630 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2020-12-23 01:45:14,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2020-12-23 01:45:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:45:14,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:14,632 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:14,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:45:14,632 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2020-12-23 01:45:14,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:14,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663734082] [2020-12-23 01:45:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:14,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663734082] [2020-12-23 01:45:14,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:14,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:14,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026325362] [2020-12-23 01:45:14,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:14,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:14,696 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2020-12-23 01:45:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:15,109 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2020-12-23 01:45:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:15,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:45:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:15,111 INFO L225 Difference]: With dead ends: 332 [2020-12-23 01:45:15,111 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 01:45:15,115 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 01:45:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 01:45:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2020-12-23 01:45:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2020-12-23 01:45:15,123 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2020-12-23 01:45:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:15,123 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2020-12-23 01:45:15,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2020-12-23 01:45:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:15,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:15,125 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:15,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:45:15,125 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2020-12-23 01:45:15,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:15,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190773482] [2020-12-23 01:45:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:15,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190773482] [2020-12-23 01:45:15,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:15,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:15,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976962212] [2020-12-23 01:45:15,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:15,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:15,227 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2020-12-23 01:45:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:15,570 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2020-12-23 01:45:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:15,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:15,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:15,574 INFO L225 Difference]: With dead ends: 330 [2020-12-23 01:45:15,574 INFO L226 Difference]: Without dead ends: 184 [2020-12-23 01:45:15,575 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 01:45:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-23 01:45:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2020-12-23 01:45:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2020-12-23 01:45:15,581 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2020-12-23 01:45:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:15,582 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2020-12-23 01:45:15,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2020-12-23 01:45:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:15,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:15,583 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:15,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:45:15,583 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:15,584 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2020-12-23 01:45:15,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:15,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385225228] [2020-12-23 01:45:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:15,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385225228] [2020-12-23 01:45:15,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:15,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:15,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147463099] [2020-12-23 01:45:15,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:15,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:15,648 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2020-12-23 01:45:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:16,022 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2020-12-23 01:45:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:16,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:16,025 INFO L225 Difference]: With dead ends: 329 [2020-12-23 01:45:16,025 INFO L226 Difference]: Without dead ends: 183 [2020-12-23 01:45:16,026 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 01:45:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-23 01:45:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2020-12-23 01:45:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2020-12-23 01:45:16,040 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2020-12-23 01:45:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:16,041 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2020-12-23 01:45:16,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2020-12-23 01:45:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 01:45:16,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:16,046 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:16,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:45:16,046 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2020-12-23 01:45:16,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:16,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79124079] [2020-12-23 01:45:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:16,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79124079] [2020-12-23 01:45:16,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:16,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:16,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74600608] [2020-12-23 01:45:16,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:16,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:16,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:16,147 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2020-12-23 01:45:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:16,497 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2020-12-23 01:45:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:16,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 01:45:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:16,499 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:45:16,499 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:45:16,500 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 01:45:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:45:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2020-12-23 01:45:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2020-12-23 01:45:16,510 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2020-12-23 01:45:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:16,510 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2020-12-23 01:45:16,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2020-12-23 01:45:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 01:45:16,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:16,512 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:16,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:45:16,512 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2020-12-23 01:45:16,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:16,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179547934] [2020-12-23 01:45:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:16,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179547934] [2020-12-23 01:45:16,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:16,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:16,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126108714] [2020-12-23 01:45:16,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:16,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:16,579 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2020-12-23 01:45:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:16,953 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2020-12-23 01:45:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:16,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 01:45:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:16,956 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:45:16,956 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:45:16,959 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 01:45:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:45:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2020-12-23 01:45:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2020-12-23 01:45:16,970 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2020-12-23 01:45:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2020-12-23 01:45:16,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2020-12-23 01:45:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 01:45:16,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:16,973 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:16,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:45:16,974 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2020-12-23 01:45:16,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:16,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248750779] [2020-12-23 01:45:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:17,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248750779] [2020-12-23 01:45:17,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:17,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:17,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960884194] [2020-12-23 01:45:17,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:17,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:17,070 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2020-12-23 01:45:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:17,541 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2020-12-23 01:45:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:17,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 01:45:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:17,543 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:45:17,544 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:45:17,544 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 01:45:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:45:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2020-12-23 01:45:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2020-12-23 01:45:17,552 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2020-12-23 01:45:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:17,552 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2020-12-23 01:45:17,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2020-12-23 01:45:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 01:45:17,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:17,554 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:17,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:45:17,554 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2020-12-23 01:45:17,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:17,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636396769] [2020-12-23 01:45:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:17,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636396769] [2020-12-23 01:45:17,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:17,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:17,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393442370] [2020-12-23 01:45:17,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:17,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:17,624 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2020-12-23 01:45:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:17,992 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2020-12-23 01:45:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:17,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 01:45:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:17,994 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:45:17,994 INFO L226 Difference]: Without dead ends: 182 [2020-12-23 01:45:17,995 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 01:45:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-12-23 01:45:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2020-12-23 01:45:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2020-12-23 01:45:18,001 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2020-12-23 01:45:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:18,002 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2020-12-23 01:45:18,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2020-12-23 01:45:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 01:45:18,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:18,003 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:18,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:45:18,003 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2020-12-23 01:45:18,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:18,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674892312] [2020-12-23 01:45:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:45:18,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674892312] [2020-12-23 01:45:18,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:18,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:18,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091842049] [2020-12-23 01:45:18,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:18,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:18,067 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2020-12-23 01:45:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:18,389 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2020-12-23 01:45:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:18,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 01:45:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:18,391 INFO L225 Difference]: With dead ends: 318 [2020-12-23 01:45:18,391 INFO L226 Difference]: Without dead ends: 172 [2020-12-23 01:45:18,392 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 01:45:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-23 01:45:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2020-12-23 01:45:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-12-23 01:45:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2020-12-23 01:45:18,398 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2020-12-23 01:45:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:18,398 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2020-12-23 01:45:18,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2020-12-23 01:45:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:45:18,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:18,399 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:18,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:45:18,400 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2020-12-23 01:45:18,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:18,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393276061] [2020-12-23 01:45:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:18,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393276061] [2020-12-23 01:45:18,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:18,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:18,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514286193] [2020-12-23 01:45:18,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:18,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:18,515 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2020-12-23 01:45:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:19,104 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2020-12-23 01:45:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:19,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:45:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:19,107 INFO L225 Difference]: With dead ends: 408 [2020-12-23 01:45:19,107 INFO L226 Difference]: Without dead ends: 262 [2020-12-23 01:45:19,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-12-23 01:45:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2020-12-23 01:45:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-12-23 01:45:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2020-12-23 01:45:19,116 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2020-12-23 01:45:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:19,117 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2020-12-23 01:45:19,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2020-12-23 01:45:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:45:19,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:19,118 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:19,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:45:19,119 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2020-12-23 01:45:19,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:19,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262183127] [2020-12-23 01:45:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:19,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262183127] [2020-12-23 01:45:19,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:19,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:19,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726954021] [2020-12-23 01:45:19,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:19,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:19,198 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2020-12-23 01:45:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:19,650 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2020-12-23 01:45:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:19,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:45:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:19,652 INFO L225 Difference]: With dead ends: 446 [2020-12-23 01:45:19,653 INFO L226 Difference]: Without dead ends: 257 [2020-12-23 01:45:19,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-12-23 01:45:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2020-12-23 01:45:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2020-12-23 01:45:19,661 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2020-12-23 01:45:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:19,662 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2020-12-23 01:45:19,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2020-12-23 01:45:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:45:19,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:19,663 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:19,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:45:19,663 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2020-12-23 01:45:19,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:19,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956064396] [2020-12-23 01:45:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:19,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956064396] [2020-12-23 01:45:19,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:19,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:19,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008642874] [2020-12-23 01:45:19,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:19,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:19,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:19,741 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2020-12-23 01:45:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:20,278 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2020-12-23 01:45:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:20,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:45:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:20,281 INFO L225 Difference]: With dead ends: 499 [2020-12-23 01:45:20,281 INFO L226 Difference]: Without dead ends: 286 [2020-12-23 01:45:20,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-12-23 01:45:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2020-12-23 01:45:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2020-12-23 01:45:20,290 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2020-12-23 01:45:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:20,291 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2020-12-23 01:45:20,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2020-12-23 01:45:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:45:20,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:20,292 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:20,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:45:20,292 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2020-12-23 01:45:20,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:20,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136573608] [2020-12-23 01:45:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:20,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136573608] [2020-12-23 01:45:20,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:20,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:20,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901749660] [2020-12-23 01:45:20,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:20,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:20,383 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2020-12-23 01:45:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:20,892 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2020-12-23 01:45:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:20,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:45:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:20,895 INFO L225 Difference]: With dead ends: 470 [2020-12-23 01:45:20,895 INFO L226 Difference]: Without dead ends: 257 [2020-12-23 01:45:20,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-12-23 01:45:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2020-12-23 01:45:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-12-23 01:45:20,906 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2020-12-23 01:45:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:20,906 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-12-23 01:45:20,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-12-23 01:45:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:45:20,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:20,907 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:20,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:45:20,908 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2020-12-23 01:45:20,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:20,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651941180] [2020-12-23 01:45:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:20,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651941180] [2020-12-23 01:45:20,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:20,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:20,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781558134] [2020-12-23 01:45:20,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:20,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:20,993 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2020-12-23 01:45:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:21,485 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2020-12-23 01:45:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:21,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:45:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:21,487 INFO L225 Difference]: With dead ends: 497 [2020-12-23 01:45:21,487 INFO L226 Difference]: Without dead ends: 284 [2020-12-23 01:45:21,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-23 01:45:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2020-12-23 01:45:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2020-12-23 01:45:21,496 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2020-12-23 01:45:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:21,496 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2020-12-23 01:45:21,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2020-12-23 01:45:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:45:21,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:21,498 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:21,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:45:21,498 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:21,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2020-12-23 01:45:21,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:21,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471539579] [2020-12-23 01:45:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:21,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471539579] [2020-12-23 01:45:21,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:21,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:21,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183586910] [2020-12-23 01:45:21,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:21,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:21,575 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2020-12-23 01:45:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:22,064 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2020-12-23 01:45:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:22,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:45:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:22,067 INFO L225 Difference]: With dead ends: 496 [2020-12-23 01:45:22,067 INFO L226 Difference]: Without dead ends: 283 [2020-12-23 01:45:22,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-23 01:45:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2020-12-23 01:45:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2020-12-23 01:45:22,077 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2020-12-23 01:45:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:22,077 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2020-12-23 01:45:22,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2020-12-23 01:45:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:45:22,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:22,079 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:22,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:45:22,081 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2020-12-23 01:45:22,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:22,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612633987] [2020-12-23 01:45:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:22,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612633987] [2020-12-23 01:45:22,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:22,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:22,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327817482] [2020-12-23 01:45:22,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:22,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:22,161 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2020-12-23 01:45:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:22,575 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2020-12-23 01:45:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:22,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:45:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:22,578 INFO L225 Difference]: With dead ends: 468 [2020-12-23 01:45:22,578 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:45:22,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:45:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2020-12-23 01:45:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2020-12-23 01:45:22,586 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2020-12-23 01:45:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:22,586 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2020-12-23 01:45:22,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2020-12-23 01:45:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:45:22,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:22,588 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:22,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:45:22,588 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2020-12-23 01:45:22,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:22,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221278639] [2020-12-23 01:45:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:22,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221278639] [2020-12-23 01:45:22,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:22,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:22,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706951829] [2020-12-23 01:45:22,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:22,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:22,657 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2020-12-23 01:45:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:23,068 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2020-12-23 01:45:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:23,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:45:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:23,071 INFO L225 Difference]: With dead ends: 467 [2020-12-23 01:45:23,071 INFO L226 Difference]: Without dead ends: 254 [2020-12-23 01:45:23,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-12-23 01:45:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2020-12-23 01:45:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2020-12-23 01:45:23,079 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2020-12-23 01:45:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:23,080 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2020-12-23 01:45:23,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2020-12-23 01:45:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:45:23,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:23,081 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:23,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:45:23,081 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2020-12-23 01:45:23,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:23,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838186430] [2020-12-23 01:45:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:23,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838186430] [2020-12-23 01:45:23,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:23,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:23,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360605454] [2020-12-23 01:45:23,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:23,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:23,153 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2020-12-23 01:45:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:23,655 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2020-12-23 01:45:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:23,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:45:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:23,658 INFO L225 Difference]: With dead ends: 495 [2020-12-23 01:45:23,658 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 01:45:23,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 01:45:23,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2020-12-23 01:45:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-12-23 01:45:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2020-12-23 01:45:23,667 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2020-12-23 01:45:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:23,667 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2020-12-23 01:45:23,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2020-12-23 01:45:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:45:23,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:23,669 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:23,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:45:23,669 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2020-12-23 01:45:23,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:23,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831008305] [2020-12-23 01:45:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 01:45:23,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831008305] [2020-12-23 01:45:23,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:23,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:45:23,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861702213] [2020-12-23 01:45:23,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:45:23,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:45:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:45:23,777 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2020-12-23 01:45:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:24,277 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2020-12-23 01:45:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:45:24,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2020-12-23 01:45:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:24,280 INFO L225 Difference]: With dead ends: 466 [2020-12-23 01:45:24,280 INFO L226 Difference]: Without dead ends: 253 [2020-12-23 01:45:24,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:45:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-12-23 01:45:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2020-12-23 01:45:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2020-12-23 01:45:24,290 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2020-12-23 01:45:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:24,291 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2020-12-23 01:45:24,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:45:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2020-12-23 01:45:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:45:24,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:24,292 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:24,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:45:24,293 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2020-12-23 01:45:24,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:24,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253127992] [2020-12-23 01:45:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:24,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253127992] [2020-12-23 01:45:24,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:24,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:24,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414571900] [2020-12-23 01:45:24,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:24,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:24,366 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2020-12-23 01:45:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:24,908 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2020-12-23 01:45:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:24,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:45:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:24,911 INFO L225 Difference]: With dead ends: 535 [2020-12-23 01:45:24,911 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 01:45:24,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 01:45:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2020-12-23 01:45:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2020-12-23 01:45:24,922 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2020-12-23 01:45:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:24,922 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2020-12-23 01:45:24,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2020-12-23 01:45:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:45:24,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:24,923 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:24,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:45:24,924 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2020-12-23 01:45:24,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:24,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152703154] [2020-12-23 01:45:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:25,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152703154] [2020-12-23 01:45:25,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:25,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:25,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599899790] [2020-12-23 01:45:25,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:25,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:25,008 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2020-12-23 01:45:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:25,402 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2020-12-23 01:45:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:25,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:45:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:25,404 INFO L225 Difference]: With dead ends: 506 [2020-12-23 01:45:25,404 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 01:45:25,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 01:45:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2020-12-23 01:45:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2020-12-23 01:45:25,415 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2020-12-23 01:45:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:25,415 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2020-12-23 01:45:25,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2020-12-23 01:45:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:45:25,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:25,417 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:25,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:45:25,417 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2020-12-23 01:45:25,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:25,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599412538] [2020-12-23 01:45:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:25,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599412538] [2020-12-23 01:45:25,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:25,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:25,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65460878] [2020-12-23 01:45:25,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:25,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:25,497 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2020-12-23 01:45:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:26,004 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2020-12-23 01:45:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:26,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:45:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:26,007 INFO L225 Difference]: With dead ends: 535 [2020-12-23 01:45:26,007 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 01:45:26,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 01:45:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2020-12-23 01:45:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2020-12-23 01:45:26,017 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2020-12-23 01:45:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:26,017 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2020-12-23 01:45:26,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2020-12-23 01:45:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:45:26,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:26,019 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:26,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:45:26,019 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2020-12-23 01:45:26,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:26,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48846193] [2020-12-23 01:45:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:26,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48846193] [2020-12-23 01:45:26,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:26,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:26,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414097394] [2020-12-23 01:45:26,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:26,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:26,101 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2020-12-23 01:45:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:26,497 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2020-12-23 01:45:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:26,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:45:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:26,502 INFO L225 Difference]: With dead ends: 506 [2020-12-23 01:45:26,502 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 01:45:26,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 01:45:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2020-12-23 01:45:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2020-12-23 01:45:26,517 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2020-12-23 01:45:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:26,517 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2020-12-23 01:45:26,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2020-12-23 01:45:26,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:45:26,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:26,519 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:26,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:45:26,519 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:26,520 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2020-12-23 01:45:26,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:26,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80011724] [2020-12-23 01:45:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:26,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80011724] [2020-12-23 01:45:26,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:26,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:26,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225885146] [2020-12-23 01:45:26,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:26,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:26,592 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2020-12-23 01:45:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:27,131 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2020-12-23 01:45:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:27,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:45:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:27,134 INFO L225 Difference]: With dead ends: 535 [2020-12-23 01:45:27,134 INFO L226 Difference]: Without dead ends: 302 [2020-12-23 01:45:27,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-12-23 01:45:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2020-12-23 01:45:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2020-12-23 01:45:27,145 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2020-12-23 01:45:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:27,145 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2020-12-23 01:45:27,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2020-12-23 01:45:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:45:27,146 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:27,147 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:27,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:45:27,147 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2020-12-23 01:45:27,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:27,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752654976] [2020-12-23 01:45:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:27,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752654976] [2020-12-23 01:45:27,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:27,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:27,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443340062] [2020-12-23 01:45:27,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:27,213 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2020-12-23 01:45:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:27,654 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2020-12-23 01:45:27,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:27,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:45:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:27,657 INFO L225 Difference]: With dead ends: 506 [2020-12-23 01:45:27,657 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 01:45:27,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 01:45:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2020-12-23 01:45:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2020-12-23 01:45:27,668 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2020-12-23 01:45:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:27,668 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2020-12-23 01:45:27,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2020-12-23 01:45:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 01:45:27,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:27,670 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:27,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:45:27,670 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2020-12-23 01:45:27,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:27,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697628083] [2020-12-23 01:45:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:27,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697628083] [2020-12-23 01:45:27,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:27,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:27,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962861057] [2020-12-23 01:45:27,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:27,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:27,751 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2020-12-23 01:45:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:28,237 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2020-12-23 01:45:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:28,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-12-23 01:45:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:28,240 INFO L225 Difference]: With dead ends: 525 [2020-12-23 01:45:28,240 INFO L226 Difference]: Without dead ends: 292 [2020-12-23 01:45:28,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-23 01:45:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2020-12-23 01:45:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2020-12-23 01:45:28,251 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2020-12-23 01:45:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:28,252 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2020-12-23 01:45:28,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2020-12-23 01:45:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 01:45:28,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:28,253 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:28,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:45:28,254 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2020-12-23 01:45:28,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:28,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961081534] [2020-12-23 01:45:28,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:28,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961081534] [2020-12-23 01:45:28,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:28,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:28,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92199102] [2020-12-23 01:45:28,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:28,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:28,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:28,336 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2020-12-23 01:45:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:28,763 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2020-12-23 01:45:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:28,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-12-23 01:45:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:28,765 INFO L225 Difference]: With dead ends: 496 [2020-12-23 01:45:28,765 INFO L226 Difference]: Without dead ends: 263 [2020-12-23 01:45:28,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-12-23 01:45:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2020-12-23 01:45:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2020-12-23 01:45:28,776 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2020-12-23 01:45:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:28,776 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2020-12-23 01:45:28,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2020-12-23 01:45:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:45:28,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:28,777 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:45:28,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:45:28,778 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2020-12-23 01:45:28,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:28,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698442952] [2020-12-23 01:45:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:45:28,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698442952] [2020-12-23 01:45:28,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:28,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:28,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802681279] [2020-12-23 01:45:28,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:28,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:28,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:28,858 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2020-12-23 01:45:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:29,354 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2020-12-23 01:45:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:29,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 01:45:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:29,357 INFO L225 Difference]: With dead ends: 525 [2020-12-23 01:45:29,357 INFO L226 Difference]: Without dead ends: 292 [2020-12-23 01:45:29,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 01:45:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-12-23 01:45:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2020-12-23 01:45:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-12-23 01:45:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2020-12-23 01:45:29,367 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2020-12-23 01:45:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:29,368 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2020-12-23 01:45:29,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2020-12-23 01:45:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:45:29,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:29,369 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:45:29,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:45:29,369 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2020-12-23 01:45:29,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:29,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788430987] [2020-12-23 01:45:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-12-23 01:45:29,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788430987] [2020-12-23 01:45:29,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:29,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:45:29,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343896348] [2020-12-23 01:45:29,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:45:29,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:45:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,440 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2020-12-23 01:45:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:29,515 INFO L93 Difference]: Finished difference Result 714 states and 1066 transitions. [2020-12-23 01:45:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:45:29,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:45:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:29,519 INFO L225 Difference]: With dead ends: 714 [2020-12-23 01:45:29,520 INFO L226 Difference]: Without dead ends: 481 [2020-12-23 01:45:29,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2020-12-23 01:45:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2020-12-23 01:45:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2020-12-23 01:45:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 711 transitions. [2020-12-23 01:45:29,539 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 711 transitions. Word has length 106 [2020-12-23 01:45:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:29,539 INFO L481 AbstractCegarLoop]: Abstraction has 481 states and 711 transitions. [2020-12-23 01:45:29,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:45:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 711 transitions. [2020-12-23 01:45:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:45:29,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:29,541 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:45:29,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:45:29,541 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash 888288017, now seen corresponding path program 1 times [2020-12-23 01:45:29,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:29,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584492969] [2020-12-23 01:45:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-12-23 01:45:29,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584492969] [2020-12-23 01:45:29,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:29,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:45:29,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247947285] [2020-12-23 01:45:29,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:45:29,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:45:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,603 INFO L87 Difference]: Start difference. First operand 481 states and 711 transitions. Second operand 3 states. [2020-12-23 01:45:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:29,670 INFO L93 Difference]: Finished difference Result 970 states and 1437 transitions. [2020-12-23 01:45:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:45:29,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:45:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:29,675 INFO L225 Difference]: With dead ends: 970 [2020-12-23 01:45:29,675 INFO L226 Difference]: Without dead ends: 508 [2020-12-23 01:45:29,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-12-23 01:45:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2020-12-23 01:45:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-12-23 01:45:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 746 transitions. [2020-12-23 01:45:29,703 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 746 transitions. Word has length 106 [2020-12-23 01:45:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:29,703 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 746 transitions. [2020-12-23 01:45:29,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:45:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 746 transitions. [2020-12-23 01:45:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:45:29,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:29,705 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:45:29,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:45:29,705 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 302011795, now seen corresponding path program 1 times [2020-12-23 01:45:29,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:29,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671387954] [2020-12-23 01:45:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-12-23 01:45:29,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671387954] [2020-12-23 01:45:29,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:29,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:45:29,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515905847] [2020-12-23 01:45:29,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:45:29,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:45:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,764 INFO L87 Difference]: Start difference. First operand 508 states and 746 transitions. Second operand 3 states. [2020-12-23 01:45:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:29,803 INFO L93 Difference]: Finished difference Result 999 states and 1473 transitions. [2020-12-23 01:45:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:45:29,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:45:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:29,807 INFO L225 Difference]: With dead ends: 999 [2020-12-23 01:45:29,807 INFO L226 Difference]: Without dead ends: 510 [2020-12-23 01:45:29,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-23 01:45:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-12-23 01:45:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-12-23 01:45:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 748 transitions. [2020-12-23 01:45:29,832 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 748 transitions. Word has length 106 [2020-12-23 01:45:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:29,832 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 748 transitions. [2020-12-23 01:45:29,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:45:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 748 transitions. [2020-12-23 01:45:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 01:45:29,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:29,835 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:29,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:45:29,835 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2020-12-23 01:45:29,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:29,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442286032] [2020-12-23 01:45:29,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:45:29,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442286032] [2020-12-23 01:45:29,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:29,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:45:29,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606060457] [2020-12-23 01:45:29,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:45:29,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:45:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:29,949 INFO L87 Difference]: Start difference. First operand 510 states and 748 transitions. Second operand 3 states. [2020-12-23 01:45:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:30,039 INFO L93 Difference]: Finished difference Result 999 states and 1472 transitions. [2020-12-23 01:45:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:45:30,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-23 01:45:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:30,042 INFO L225 Difference]: With dead ends: 999 [2020-12-23 01:45:30,042 INFO L226 Difference]: Without dead ends: 510 [2020-12-23 01:45:30,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:45:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-12-23 01:45:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-12-23 01:45:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-12-23 01:45:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 743 transitions. [2020-12-23 01:45:30,065 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 743 transitions. Word has length 125 [2020-12-23 01:45:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:30,066 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 743 transitions. [2020-12-23 01:45:30,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:45:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 743 transitions. [2020-12-23 01:45:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-23 01:45:30,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:30,068 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:45:30,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:45:30,069 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2020-12-23 01:45:30,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:30,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516260918] [2020-12-23 01:45:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:45:30,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:45:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:45:30,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:45:30,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:45:30,512 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:45:30,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 01:45:30,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:45:30 BoogieIcfgContainer [2020-12-23 01:45:30,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:45:30,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:45:30,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:45:30,743 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:45:30,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:08" (3/4) ... [2020-12-23 01:45:30,748 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:45:30,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:45:30,752 INFO L168 Benchmark]: Toolchain (without parser) took 24711.68 ms. Allocated memory was 156.2 MB in the beginning and 264.2 MB in the end (delta: 108.0 MB). Free memory was 129.4 MB in the beginning and 216.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,752 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 156.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:45:30,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.72 ms. Allocated memory is still 156.2 MB. Free memory was 129.3 MB in the beginning and 128.5 MB in the end (delta: 831.4 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.16 ms. Allocated memory is still 156.2 MB. Free memory was 128.5 MB in the beginning and 124.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,754 INFO L168 Benchmark]: Boogie Preprocessor took 147.49 ms. Allocated memory is still 156.2 MB. Free memory was 124.3 MB in the beginning and 117.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,754 INFO L168 Benchmark]: RCFGBuilder took 1509.64 ms. Allocated memory is still 156.2 MB. Free memory was 117.4 MB in the beginning and 111.3 MB in the end (delta: 6.1 MB). Peak memory consumption was 74.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,754 INFO L168 Benchmark]: TraceAbstraction took 22065.70 ms. Allocated memory was 156.2 MB in the beginning and 264.2 MB in the end (delta: 108.0 MB). Free memory was 111.3 MB in the beginning and 216.1 MB in the end (delta: -104.8 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:45:30,755 INFO L168 Benchmark]: Witness Printer took 5.68 ms. Allocated memory is still 264.2 MB. Free memory is still 216.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:45:30,757 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 156.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 877.72 ms. Allocated memory is still 156.2 MB. Free memory was 129.3 MB in the beginning and 128.5 MB in the end (delta: 831.4 kB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 96.16 ms. Allocated memory is still 156.2 MB. Free memory was 128.5 MB in the beginning and 124.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 147.49 ms. Allocated memory is still 156.2 MB. Free memory was 124.3 MB in the beginning and 117.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1509.64 ms. Allocated memory is still 156.2 MB. Free memory was 117.4 MB in the beginning and 111.3 MB in the end (delta: 6.1 MB). Peak memory consumption was 74.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22065.70 ms. Allocated memory was 156.2 MB in the beginning and 264.2 MB in the end (delta: 108.0 MB). Free memory was 111.3 MB in the beginning and 216.1 MB in the end (delta: -104.8 MB). Peak memory consumption was 141.7 MB. Max. memory is 8.0 GB. * Witness Printer took 5.68 ms. Allocated memory is still 264.2 MB. Free memory is still 216.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1708]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1122. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1083] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp = __VERIFIER_nondet_long() ; [L1087] void (*cb)() ; [L1088] long num1 ; [L1089] int ret ; [L1090] int new_state ; [L1091] int state ; [L1092] int skip ; [L1093] int got_new_session ; [L1094] int tmp___1 = __VERIFIER_nondet_int() ; [L1095] int tmp___2 = __VERIFIER_nondet_int() ; [L1096] int tmp___3 ; [L1097] int tmp___4 ; [L1098] int tmp___5 ; [L1099] int tmp___6 ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 ; [L1103] int tmp___10 ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] Time = tmp [L1112] cb = (void (*)())((void *)0) [L1113] ret = -1 [L1114] skip = 0 [L1115] got_new_session = 0 [L1116] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1116] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1117] EXPR s->info_callback [L1117] cb = s->info_callback [L1121] EXPR s->in_handshake [L1121] s->in_handshake += 1 [L1122] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1131] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1131] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND TRUE s->state == 8464 [L1320] s->shutdown = 0 [L1321] ret = __VERIFIER_nondet_int() [L1322] COND TRUE blastFlag == 0 [L1323] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1327] COND FALSE !(ret <= 0) [L1332] got_new_session = 1 [L1333] s->state = 8496 [L1334] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND TRUE s->state == 8496 [L1338] ret = __VERIFIER_nondet_int() [L1339] COND TRUE blastFlag == 1 [L1340] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1344] COND FALSE !(ret <= 0) [L1349] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND TRUE s->hit [L1350] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1354] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1230] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] tmp___9 = __VERIFIER_nondet_int() [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 5 VAL [init=1, SSLv3_server_data={6:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 [L1575] tmp___10 = __VERIFIER_nondet_int() [L1576] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1667] EXPR s->s3 [L1667] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1667] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1696] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1137] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1139] EXPR s->state [L1139] state = s->state [L1140] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1140] COND FALSE !(s->state == 12292) [L1143] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1143] COND FALSE !(s->state == 16384) [L1146] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1146] COND FALSE !(s->state == 8192) [L1149] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1149] COND FALSE !(s->state == 24576) [L1152] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1152] COND FALSE !(s->state == 8195) [L1155] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1155] COND FALSE !(s->state == 8480) [L1158] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1158] COND FALSE !(s->state == 8481) [L1161] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1161] COND FALSE !(s->state == 8482) [L1164] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1164] COND FALSE !(s->state == 8464) [L1167] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1167] COND FALSE !(s->state == 8465) [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1170] COND FALSE !(s->state == 8466) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1173] COND FALSE !(s->state == 8496) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1176] COND FALSE !(s->state == 8497) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1179] COND FALSE !(s->state == 8512) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1182] COND FALSE !(s->state == 8513) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1185] COND FALSE !(s->state == 8528) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1188] COND FALSE !(s->state == 8529) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1191] COND FALSE !(s->state == 8544) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1194] COND FALSE !(s->state == 8545) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1197] COND FALSE !(s->state == 8560) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1200] COND FALSE !(s->state == 8561) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1203] COND FALSE !(s->state == 8448) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1206] COND FALSE !(s->state == 8576) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1209] COND FALSE !(s->state == 8577) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1212] COND FALSE !(s->state == 8592) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1215] COND FALSE !(s->state == 8593) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1218] COND FALSE !(s->state == 8608) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1221] COND FALSE !(s->state == 8609) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1224] COND FALSE !(s->state == 8640) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1227] COND FALSE !(s->state == 8641) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1230] COND FALSE !(s->state == 8656) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1233] COND FALSE !(s->state == 8657) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1236] COND TRUE s->state == 8672 [L1585] ret = __VERIFIER_nondet_int() [L1586] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={6:0}] [L1589] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={6:0}] [L1708] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.7s, OverallIterations: 42, TraceHistogramMax: 4, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8012 SDtfs, 2270 SDslu, 11389 SDs, 0 SdLazy, 6913 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 82 SyntacticMatches, 29 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 41 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3646 NumberOfCodeBlocks, 3646 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3479 ConstructedInterpolants, 0 QuantifiedInterpolants, 795476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 1839/1839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...