/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.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:45:44,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:45:44,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:45:44,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:45:44,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:45:44,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:45:44,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:45:44,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:45:44,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:45:44,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:45:44,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:45:44,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:45:44,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:45:44,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:45:44,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:45:44,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:45:44,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:45:44,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:45:44,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:45:44,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:45:44,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:45:44,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:45:44,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:45:44,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:45:44,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:45:44,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:45:44,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:45:44,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:45:44,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:45:44,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:45:44,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:45:44,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:45:44,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:45:44,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:45:44,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:45:44,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:45:44,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:45:44,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:45:44,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:45:44,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:45:44,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:45:44,541 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:44,593 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:45:44,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:45:44,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:45:44,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:45:44,595 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:45:44,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:45:44,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:45:44,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:45:44,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:45:44,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:45:44,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:45:44,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:45:44,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:45:44,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:45:44,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:45:44,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:45:44,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:45:44,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:45:44,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:45:44,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:45:44,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:45:44,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:45:44,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:45:44,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:45:44,600 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:45:44,600 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:45,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:45:45,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:45:45,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:45:45,116 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:45:45,117 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:45:45,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2020-12-23 01:45:45,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2b46075d/9c2e72f27c61462fa1a86c643801d660/FLAG59bbea8a3 [2020-12-23 01:45:46,190 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:45:46,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2020-12-23 01:45:46,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2b46075d/9c2e72f27c61462fa1a86c643801d660/FLAG59bbea8a3 [2020-12-23 01:45:46,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2b46075d/9c2e72f27c61462fa1a86c643801d660 [2020-12-23 01:45:46,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:45:46,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:45:46,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:45:46,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:45:46,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:45:46,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:46" (1/1) ... [2020-12-23 01:45:46,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6167afa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:46, skipping insertion in model container [2020-12-23 01:45:46,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:46" (1/1) ... [2020-12-23 01:45:46,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:45:46,441 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[~tmp~3,] 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[~buf~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[80],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: 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~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],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~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] 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~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],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~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],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~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],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~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],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~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],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: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],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[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~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],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[~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[~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~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],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[~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:47,074 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.03.i.cil.c[71313,71326] 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:47,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:45:47,135 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[~tmp~3,] 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[~buf~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[80],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: 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~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],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~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] 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~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],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~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],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~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],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~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],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~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],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: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],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[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~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],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[~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[~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~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],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[~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:47,324 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.03.i.cil.c[71313,71326] 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:47,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:45:47,351 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:45:47,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:47 WrapperNode [2020-12-23 01:45:47,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:45:47,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:45:47,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:45:47,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:45:47,363 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:47" (1/1) ... [2020-12-23 01:45:47,390 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:47" (1/1) ... [2020-12-23 01:45:47,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:45:47,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:45:47,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:45:47,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:45:47,489 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:47" (1/1) ... [2020-12-23 01:45:47,489 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:47" (1/1) ... [2020-12-23 01:45:47,515 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:47" (1/1) ... [2020-12-23 01:45:47,518 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:47" (1/1) ... [2020-12-23 01:45:47,581 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:47" (1/1) ... [2020-12-23 01:45:47,591 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:47" (1/1) ... [2020-12-23 01:45:47,595 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:47" (1/1) ... [2020-12-23 01:45:47,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:45:47,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:45:47,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:45:47,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:45:47,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:47" (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:47,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:45:47,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:45:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:45:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:45:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:45:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:45:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:45:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:45:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:45:48,066 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:45:48,902 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:45:48,902 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:45:48,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:45:48,918 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:45:48,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:48 BoogieIcfgContainer [2020-12-23 01:45:48,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:45:48,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:45:48,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:45:48,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:45:48,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:45:46" (1/3) ... [2020-12-23 01:45:48,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c1902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:48, skipping insertion in model container [2020-12-23 01:45:48,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:47" (2/3) ... [2020-12-23 01:45:48,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382c1902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:48, skipping insertion in model container [2020-12-23 01:45:48,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:48" (3/3) ... [2020-12-23 01:45:48,930 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2020-12-23 01:45:48,937 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:45:48,943 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:45:48,966 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:45:48,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:45:49,000 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:45:49,000 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:45:49,000 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:45:49,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:45:49,001 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:45:49,001 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:45:49,001 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:45:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-12-23 01:45:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:45:49,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:49,037 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:49,038 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2020-12-23 01:45:49,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:49,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444157835] [2020-12-23 01:45:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:49,603 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:49,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444157835] [2020-12-23 01:45:49,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:49,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:49,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791093444] [2020-12-23 01:45:49,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:49,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:49,633 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2020-12-23 01:45:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:50,219 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2020-12-23 01:45:50,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:50,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-23 01:45:50,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:50,237 INFO L225 Difference]: With dead ends: 313 [2020-12-23 01:45:50,237 INFO L226 Difference]: Without dead ends: 158 [2020-12-23 01:45:50,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:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-23 01:45:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-23 01:45:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2020-12-23 01:45:50,314 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2020-12-23 01:45:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:50,315 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2020-12-23 01:45:50,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2020-12-23 01:45:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:45:50,324 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:50,325 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:50,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:45:50,325 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2020-12-23 01:45:50,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:50,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466557499] [2020-12-23 01:45:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:50,478 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:50,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466557499] [2020-12-23 01:45:50,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:50,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:50,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761298702] [2020-12-23 01:45:50,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:50,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:50,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:50,483 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2020-12-23 01:45:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:51,016 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2020-12-23 01:45:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:51,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:45:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:51,019 INFO L225 Difference]: With dead ends: 280 [2020-12-23 01:45:51,019 INFO L226 Difference]: Without dead ends: 158 [2020-12-23 01:45:51,021 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:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-12-23 01:45:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-12-23 01:45:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2020-12-23 01:45:51,034 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2020-12-23 01:45:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:51,034 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2020-12-23 01:45:51,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2020-12-23 01:45:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:51,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:51,037 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] [2020-12-23 01:45:51,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:45:51,037 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:51,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:51,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2020-12-23 01:45:51,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:51,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867161334] [2020-12-23 01:45:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:51,149 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:51,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867161334] [2020-12-23 01:45:51,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:51,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:51,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269983066] [2020-12-23 01:45:51,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:51,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:51,166 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2020-12-23 01:45:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:51,600 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2020-12-23 01:45:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:51,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:51,603 INFO L225 Difference]: With dead ends: 279 [2020-12-23 01:45:51,603 INFO L226 Difference]: Without dead ends: 157 [2020-12-23 01:45:51,604 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:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-23 01:45:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2020-12-23 01:45:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2020-12-23 01:45:51,614 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2020-12-23 01:45:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:51,615 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2020-12-23 01:45:51,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2020-12-23 01:45:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:51,616 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:51,617 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:51,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:45:51,617 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2020-12-23 01:45:51,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:51,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35711264] [2020-12-23 01:45:51,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:51,713 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:51,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35711264] [2020-12-23 01:45:51,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:51,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:51,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533477804] [2020-12-23 01:45:51,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:51,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:51,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:51,717 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2020-12-23 01:45:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:52,229 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2020-12-23 01:45:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:52,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:52,231 INFO L225 Difference]: With dead ends: 277 [2020-12-23 01:45:52,231 INFO L226 Difference]: Without dead ends: 155 [2020-12-23 01:45:52,232 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:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-12-23 01:45:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2020-12-23 01:45:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2020-12-23 01:45:52,241 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2020-12-23 01:45:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:52,242 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2020-12-23 01:45:52,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2020-12-23 01:45:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:52,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:52,243 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:52,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:45:52,244 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2020-12-23 01:45:52,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:52,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271067] [2020-12-23 01:45:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:52,327 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:52,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271067] [2020-12-23 01:45:52,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:52,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:52,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700963737] [2020-12-23 01:45:52,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:52,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:52,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:52,330 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2020-12-23 01:45:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:52,718 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2020-12-23 01:45:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:52,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:52,721 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:45:52,721 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:45:52,723 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:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:45:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:45:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2020-12-23 01:45:52,750 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2020-12-23 01:45:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:52,750 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2020-12-23 01:45:52,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2020-12-23 01:45:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:45:52,752 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:52,752 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] [2020-12-23 01:45:52,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:45:52,752 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2020-12-23 01:45:52,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:52,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585159278] [2020-12-23 01:45:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:52,880 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:52,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585159278] [2020-12-23 01:45:52,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:52,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:52,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447882240] [2020-12-23 01:45:52,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:52,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:52,882 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2020-12-23 01:45:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:53,254 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2020-12-23 01:45:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:53,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:45:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:53,257 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:45:53,257 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:45:53,258 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:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:45:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:45:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2020-12-23 01:45:53,265 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2020-12-23 01:45:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:53,265 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2020-12-23 01:45:53,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2020-12-23 01:45:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 01:45:53,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:53,267 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] [2020-12-23 01:45:53,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:45:53,267 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2020-12-23 01:45:53,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:53,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804683582] [2020-12-23 01:45:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:53,329 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:53,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804683582] [2020-12-23 01:45:53,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:53,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:53,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603480848] [2020-12-23 01:45:53,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:53,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:53,332 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2020-12-23 01:45:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:53,705 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2020-12-23 01:45:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:53,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 01:45:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:53,707 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:45:53,707 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:45:53,707 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:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:45:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:45:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2020-12-23 01:45:53,716 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2020-12-23 01:45:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:53,717 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2020-12-23 01:45:53,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2020-12-23 01:45:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:45:53,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:53,718 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] [2020-12-23 01:45:53,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:45:53,718 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:53,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2020-12-23 01:45:53,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:53,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554172477] [2020-12-23 01:45:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:53,794 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:53,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554172477] [2020-12-23 01:45:53,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:53,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:53,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143324399] [2020-12-23 01:45:53,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:53,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:53,798 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2020-12-23 01:45:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:54,192 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2020-12-23 01:45:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:54,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 01:45:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:54,194 INFO L225 Difference]: With dead ends: 276 [2020-12-23 01:45:54,194 INFO L226 Difference]: Without dead ends: 154 [2020-12-23 01:45:54,195 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:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-23 01:45:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2020-12-23 01:45:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2020-12-23 01:45:54,202 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2020-12-23 01:45:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:54,202 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2020-12-23 01:45:54,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2020-12-23 01:45:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:45:54,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:54,204 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] [2020-12-23 01:45:54,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:45:54,205 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2020-12-23 01:45:54,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:54,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378929855] [2020-12-23 01:45:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:54,272 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:54,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378929855] [2020-12-23 01:45:54,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:54,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:54,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593520992] [2020-12-23 01:45:54,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:54,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:54,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:54,275 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2020-12-23 01:45:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:54,622 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2020-12-23 01:45:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:54,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:45:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:54,624 INFO L225 Difference]: With dead ends: 266 [2020-12-23 01:45:54,624 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 01:45:54,625 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:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 01:45:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2020-12-23 01:45:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-12-23 01:45:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2020-12-23 01:45:54,630 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2020-12-23 01:45:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:54,631 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2020-12-23 01:45:54,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2020-12-23 01:45:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 01:45:54,632 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:54,632 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:54,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:45:54,633 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2020-12-23 01:45:54,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:54,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135823343] [2020-12-23 01:45:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:54,712 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:54,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135823343] [2020-12-23 01:45:54,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:54,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:54,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582547238] [2020-12-23 01:45:54,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:54,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:54,715 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2020-12-23 01:45:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:55,136 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2020-12-23 01:45:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:55,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 01:45:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:55,139 INFO L225 Difference]: With dead ends: 306 [2020-12-23 01:45:55,139 INFO L226 Difference]: Without dead ends: 184 [2020-12-23 01:45:55,140 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:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-23 01:45:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-23 01:45:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2020-12-23 01:45:55,147 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2020-12-23 01:45:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:55,148 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2020-12-23 01:45:55,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2020-12-23 01:45:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:45:55,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:55,149 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:55,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:45:55,149 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2020-12-23 01:45:55,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:55,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942723066] [2020-12-23 01:45:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:55,235 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:55,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942723066] [2020-12-23 01:45:55,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:55,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:55,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760267611] [2020-12-23 01:45:55,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:55,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:55,244 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2020-12-23 01:45:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:55,654 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2020-12-23 01:45:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:55,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:45:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:55,656 INFO L225 Difference]: With dead ends: 328 [2020-12-23 01:45:55,656 INFO L226 Difference]: Without dead ends: 184 [2020-12-23 01:45:55,657 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:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-12-23 01:45:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2020-12-23 01:45:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2020-12-23 01:45:55,664 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2020-12-23 01:45:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:55,664 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2020-12-23 01:45:55,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2020-12-23 01:45:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:55,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:55,666 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] [2020-12-23 01:45:55,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:45:55,666 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2020-12-23 01:45:55,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:55,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459693213] [2020-12-23 01:45:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:55,724 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:55,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459693213] [2020-12-23 01:45:55,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:55,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:55,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039848962] [2020-12-23 01:45:55,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:55,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:55,726 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2020-12-23 01:45:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:56,144 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2020-12-23 01:45:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:56,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:56,146 INFO L225 Difference]: With dead ends: 327 [2020-12-23 01:45:56,146 INFO L226 Difference]: Without dead ends: 183 [2020-12-23 01:45:56,147 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:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-23 01:45:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2020-12-23 01:45:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2020-12-23 01:45:56,154 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2020-12-23 01:45:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:56,155 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2020-12-23 01:45:56,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2020-12-23 01:45:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:56,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:56,156 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:56,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:45:56,156 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2020-12-23 01:45:56,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:56,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657691438] [2020-12-23 01:45:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:56,225 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:56,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657691438] [2020-12-23 01:45:56,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:56,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:56,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265685355] [2020-12-23 01:45:56,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:56,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:56,227 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2020-12-23 01:45:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:56,595 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2020-12-23 01:45:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:56,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:56,598 INFO L225 Difference]: With dead ends: 325 [2020-12-23 01:45:56,599 INFO L226 Difference]: Without dead ends: 181 [2020-12-23 01:45:56,599 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:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-23 01:45:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2020-12-23 01:45:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2020-12-23 01:45:56,611 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2020-12-23 01:45:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:56,616 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2020-12-23 01:45:56,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2020-12-23 01:45:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:56,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:56,618 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:56,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:45:56,620 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2020-12-23 01:45:56,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:56,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764644911] [2020-12-23 01:45:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:56,712 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:56,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764644911] [2020-12-23 01:45:56,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:56,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:56,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885107910] [2020-12-23 01:45:56,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:56,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:56,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:56,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:56,714 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2020-12-23 01:45:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:57,222 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2020-12-23 01:45:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:57,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:57,224 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:45:57,225 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:45:57,225 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:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:45:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:45:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2020-12-23 01:45:57,232 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2020-12-23 01:45:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:57,232 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2020-12-23 01:45:57,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2020-12-23 01:45:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:45:57,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:57,233 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] [2020-12-23 01:45:57,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:45:57,234 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2020-12-23 01:45:57,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:57,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357081848] [2020-12-23 01:45:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:57,296 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:57,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357081848] [2020-12-23 01:45:57,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:57,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:57,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785448177] [2020-12-23 01:45:57,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:57,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:57,299 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2020-12-23 01:45:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:57,686 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2020-12-23 01:45:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:57,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:45:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:57,689 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:45:57,689 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:45:57,690 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:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:45:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:45:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2020-12-23 01:45:57,695 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2020-12-23 01:45:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:57,696 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2020-12-23 01:45:57,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2020-12-23 01:45:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 01:45:57,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:57,697 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] [2020-12-23 01:45:57,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:45:57,698 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2020-12-23 01:45:57,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:57,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507029849] [2020-12-23 01:45:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:57,760 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:57,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507029849] [2020-12-23 01:45:57,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:57,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:57,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442983676] [2020-12-23 01:45:57,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:57,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:57,763 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2020-12-23 01:45:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:58,166 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2020-12-23 01:45:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:58,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 01:45:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:58,169 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:45:58,169 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:45:58,170 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:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:45:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:45:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2020-12-23 01:45:58,176 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2020-12-23 01:45:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:58,176 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2020-12-23 01:45:58,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2020-12-23 01:45:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 01:45:58,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:58,178 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] [2020-12-23 01:45:58,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:45:58,178 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2020-12-23 01:45:58,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:58,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041509972] [2020-12-23 01:45:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:58,233 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:58,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041509972] [2020-12-23 01:45:58,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:58,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:58,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336331955] [2020-12-23 01:45:58,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:58,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:58,235 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2020-12-23 01:45:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:58,627 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2020-12-23 01:45:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:58,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 01:45:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:58,630 INFO L225 Difference]: With dead ends: 324 [2020-12-23 01:45:58,630 INFO L226 Difference]: Without dead ends: 180 [2020-12-23 01:45:58,630 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:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-12-23 01:45:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2020-12-23 01:45:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2020-12-23 01:45:58,636 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2020-12-23 01:45:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:58,636 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2020-12-23 01:45:58,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2020-12-23 01:45:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 01:45:58,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:58,637 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] [2020-12-23 01:45:58,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:45:58,638 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2020-12-23 01:45:58,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:58,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173669084] [2020-12-23 01:45:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:58,703 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:58,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173669084] [2020-12-23 01:45:58,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:58,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:58,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174431335] [2020-12-23 01:45:58,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:58,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:58,705 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2020-12-23 01:45:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:59,071 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2020-12-23 01:45:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:59,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 01:45:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:59,073 INFO L225 Difference]: With dead ends: 314 [2020-12-23 01:45:59,073 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:45:59,074 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:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:45:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2020-12-23 01:45:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:45:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2020-12-23 01:45:59,080 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2020-12-23 01:45:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:59,080 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2020-12-23 01:45:59,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2020-12-23 01:45:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:45:59,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:59,082 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:59,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:45:59,082 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2020-12-23 01:45:59,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:59,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410424709] [2020-12-23 01:45:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:59,187 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:59,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410424709] [2020-12-23 01:45:59,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:59,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:59,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652604809] [2020-12-23 01:45:59,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:59,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:59,193 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2020-12-23 01:45:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:45:59,771 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2020-12-23 01:45:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:45:59,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:45:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:45:59,774 INFO L225 Difference]: With dead ends: 403 [2020-12-23 01:45:59,774 INFO L226 Difference]: Without dead ends: 259 [2020-12-23 01:45:59,775 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:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-23 01:45:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2020-12-23 01:45:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-12-23 01:45:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2020-12-23 01:45:59,783 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2020-12-23 01:45:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:45:59,783 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2020-12-23 01:45:59,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:45:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2020-12-23 01:45:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:45:59,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:45:59,785 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:59,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:45:59,785 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:45:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:45:59,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2020-12-23 01:45:59,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:45:59,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870790995] [2020-12-23 01:45:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:45:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:45:59,853 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:59,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870790995] [2020-12-23 01:45:59,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:45:59,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:45:59,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279381831] [2020-12-23 01:45:59,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:45:59,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:45:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:45:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:45:59,855 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2020-12-23 01:46:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:00,314 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2020-12-23 01:46:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:00,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:46:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:00,317 INFO L225 Difference]: With dead ends: 442 [2020-12-23 01:46:00,317 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:46:00,317 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:46:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:46:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-23 01:46:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2020-12-23 01:46:00,325 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2020-12-23 01:46:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:00,325 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2020-12-23 01:46:00,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2020-12-23 01:46:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:00,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:00,327 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:46:00,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:46:00,327 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2020-12-23 01:46:00,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:00,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731747637] [2020-12-23 01:46:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:00,423 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:46:00,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731747637] [2020-12-23 01:46:00,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:00,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:00,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718641922] [2020-12-23 01:46:00,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:00,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:00,425 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2020-12-23 01:46:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:01,031 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2020-12-23 01:46:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:01,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:01,033 INFO L225 Difference]: With dead ends: 494 [2020-12-23 01:46:01,034 INFO L226 Difference]: Without dead ends: 283 [2020-12-23 01:46:01,034 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:46:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-12-23 01:46:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2020-12-23 01:46:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2020-12-23 01:46:01,042 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2020-12-23 01:46:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:01,042 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2020-12-23 01:46:01,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2020-12-23 01:46:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:01,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:01,044 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:46:01,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:46:01,045 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2020-12-23 01:46:01,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:01,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840772421] [2020-12-23 01:46:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:01,117 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:46:01,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840772421] [2020-12-23 01:46:01,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:01,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:01,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997412403] [2020-12-23 01:46:01,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:01,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:01,119 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2020-12-23 01:46:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:01,610 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2020-12-23 01:46:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:01,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:01,612 INFO L225 Difference]: With dead ends: 466 [2020-12-23 01:46:01,612 INFO L226 Difference]: Without dead ends: 255 [2020-12-23 01:46:01,613 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:46:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-12-23 01:46:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2020-12-23 01:46:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2020-12-23 01:46:01,621 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2020-12-23 01:46:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:01,621 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2020-12-23 01:46:01,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2020-12-23 01:46:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:01,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:01,623 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] [2020-12-23 01:46:01,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:46:01,623 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2020-12-23 01:46:01,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:01,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561734481] [2020-12-23 01:46:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:01,717 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:46:01,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561734481] [2020-12-23 01:46:01,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:01,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:01,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245186221] [2020-12-23 01:46:01,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:01,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:01,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:01,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:01,723 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2020-12-23 01:46:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:02,271 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2020-12-23 01:46:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:02,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:02,274 INFO L225 Difference]: With dead ends: 493 [2020-12-23 01:46:02,274 INFO L226 Difference]: Without dead ends: 282 [2020-12-23 01:46:02,275 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:46:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-23 01:46:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2020-12-23 01:46:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2020-12-23 01:46:02,282 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2020-12-23 01:46:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:02,283 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2020-12-23 01:46:02,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2020-12-23 01:46:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:02,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:02,284 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:46:02,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:46:02,285 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:02,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2020-12-23 01:46:02,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:02,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563651150] [2020-12-23 01:46:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:02,354 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:46:02,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563651150] [2020-12-23 01:46:02,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:02,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:02,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543133386] [2020-12-23 01:46:02,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:02,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:02,356 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2020-12-23 01:46:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:02,921 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2020-12-23 01:46:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:02,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:02,924 INFO L225 Difference]: With dead ends: 491 [2020-12-23 01:46:02,924 INFO L226 Difference]: Without dead ends: 280 [2020-12-23 01:46:02,925 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:46:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-23 01:46:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2020-12-23 01:46:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2020-12-23 01:46:02,932 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2020-12-23 01:46:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:02,932 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2020-12-23 01:46:02,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2020-12-23 01:46:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:02,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:02,933 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:46:02,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:46:02,934 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2020-12-23 01:46:02,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:02,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364377227] [2020-12-23 01:46:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:03,004 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:46:03,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364377227] [2020-12-23 01:46:03,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:03,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:03,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743419757] [2020-12-23 01:46:03,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:03,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:03,006 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2020-12-23 01:46:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:03,573 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2020-12-23 01:46:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:03,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:03,576 INFO L225 Difference]: With dead ends: 490 [2020-12-23 01:46:03,576 INFO L226 Difference]: Without dead ends: 279 [2020-12-23 01:46:03,576 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:46:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-23 01:46:03,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-12-23 01:46:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-12-23 01:46:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2020-12-23 01:46:03,584 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2020-12-23 01:46:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:03,584 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2020-12-23 01:46:03,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2020-12-23 01:46:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:03,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:03,586 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] [2020-12-23 01:46:03,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:46:03,586 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2020-12-23 01:46:03,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:03,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950812250] [2020-12-23 01:46:03,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:03,667 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:46:03,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950812250] [2020-12-23 01:46:03,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:03,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:46:03,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810837589] [2020-12-23 01:46:03,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:46:03,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:46:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:03,669 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2020-12-23 01:46:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:04,261 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2020-12-23 01:46:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:46:04,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 01:46:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:04,264 INFO L225 Difference]: With dead ends: 462 [2020-12-23 01:46:04,264 INFO L226 Difference]: Without dead ends: 251 [2020-12-23 01:46:04,265 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:46:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-12-23 01:46:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2020-12-23 01:46:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2020-12-23 01:46:04,273 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2020-12-23 01:46:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:04,274 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2020-12-23 01:46:04,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:46:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2020-12-23 01:46:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:04,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:04,275 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:46:04,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:46:04,276 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2020-12-23 01:46:04,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:04,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645284547] [2020-12-23 01:46:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:04,364 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:46:04,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645284547] [2020-12-23 01:46:04,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:04,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:04,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807473808] [2020-12-23 01:46:04,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:04,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:04,366 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2020-12-23 01:46:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:04,775 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2020-12-23 01:46:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:04,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:04,779 INFO L225 Difference]: With dead ends: 503 [2020-12-23 01:46:04,779 INFO L226 Difference]: Without dead ends: 272 [2020-12-23 01:46:04,780 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:46:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-23 01:46:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2020-12-23 01:46:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2020-12-23 01:46:04,788 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2020-12-23 01:46:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:04,788 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2020-12-23 01:46:04,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2020-12-23 01:46:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:04,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:04,789 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:46:04,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:46:04,790 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2020-12-23 01:46:04,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:04,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647452992] [2020-12-23 01:46:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:04,853 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:46:04,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647452992] [2020-12-23 01:46:04,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:04,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:04,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513937593] [2020-12-23 01:46:04,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:04,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:04,855 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2020-12-23 01:46:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:05,225 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2020-12-23 01:46:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:05,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:05,228 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:05,228 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:05,229 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:46:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2020-12-23 01:46:05,237 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2020-12-23 01:46:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:05,238 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2020-12-23 01:46:05,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2020-12-23 01:46:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:05,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:05,239 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:46:05,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:46:05,240 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2020-12-23 01:46:05,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:05,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222772394] [2020-12-23 01:46:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:05,303 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:46:05,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222772394] [2020-12-23 01:46:05,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:05,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:05,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112621109] [2020-12-23 01:46:05,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:05,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:05,305 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2020-12-23 01:46:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:05,874 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2020-12-23 01:46:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:05,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:05,878 INFO L225 Difference]: With dead ends: 530 [2020-12-23 01:46:05,878 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:46:05,879 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:46:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:46:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-23 01:46:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2020-12-23 01:46:05,888 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2020-12-23 01:46:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:05,888 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2020-12-23 01:46:05,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2020-12-23 01:46:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:05,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:05,890 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:46:05,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:46:05,890 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2020-12-23 01:46:05,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:05,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327840481] [2020-12-23 01:46:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:05,974 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:46:05,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327840481] [2020-12-23 01:46:05,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:05,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:05,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660184334] [2020-12-23 01:46:05,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:05,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:05,976 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2020-12-23 01:46:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:06,377 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2020-12-23 01:46:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:06,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:06,380 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:06,380 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:06,381 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:46:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2020-12-23 01:46:06,389 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2020-12-23 01:46:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:06,389 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2020-12-23 01:46:06,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2020-12-23 01:46:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:06,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:06,391 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] [2020-12-23 01:46:06,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:46:06,391 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2020-12-23 01:46:06,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:06,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912859603] [2020-12-23 01:46:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:06,457 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:46:06,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912859603] [2020-12-23 01:46:06,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:06,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:06,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039865268] [2020-12-23 01:46:06,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:06,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:06,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:06,459 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2020-12-23 01:46:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:07,045 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2020-12-23 01:46:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:07,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:07,048 INFO L225 Difference]: With dead ends: 530 [2020-12-23 01:46:07,048 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:46:07,049 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:46:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:46:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-23 01:46:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2020-12-23 01:46:07,060 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2020-12-23 01:46:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:07,060 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2020-12-23 01:46:07,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2020-12-23 01:46:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:07,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:07,062 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] [2020-12-23 01:46:07,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:46:07,063 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2020-12-23 01:46:07,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:07,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781292268] [2020-12-23 01:46:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:07,147 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:46:07,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781292268] [2020-12-23 01:46:07,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:07,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:07,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390915927] [2020-12-23 01:46:07,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:07,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:07,152 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2020-12-23 01:46:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:07,573 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2020-12-23 01:46:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:07,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:07,574 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:07,574 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:07,575 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:46:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2020-12-23 01:46:07,584 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2020-12-23 01:46:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:07,584 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2020-12-23 01:46:07,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2020-12-23 01:46:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:07,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:07,586 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] [2020-12-23 01:46:07,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:46:07,586 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2020-12-23 01:46:07,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:07,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880573786] [2020-12-23 01:46:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:07,655 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:46:07,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880573786] [2020-12-23 01:46:07,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:07,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:07,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609061354] [2020-12-23 01:46:07,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:07,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:07,658 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2020-12-23 01:46:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:08,229 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2020-12-23 01:46:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:08,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:08,232 INFO L225 Difference]: With dead ends: 530 [2020-12-23 01:46:08,232 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:46:08,233 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:46:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:46:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2020-12-23 01:46:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2020-12-23 01:46:08,244 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2020-12-23 01:46:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:08,244 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2020-12-23 01:46:08,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2020-12-23 01:46:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:08,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:08,246 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] [2020-12-23 01:46:08,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:46:08,246 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:08,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2020-12-23 01:46:08,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:08,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602437466] [2020-12-23 01:46:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:08,327 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:46:08,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602437466] [2020-12-23 01:46:08,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:08,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:08,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858317607] [2020-12-23 01:46:08,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:08,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:08,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:08,329 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2020-12-23 01:46:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:08,752 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2020-12-23 01:46:08,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:08,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:08,755 INFO L225 Difference]: With dead ends: 502 [2020-12-23 01:46:08,755 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:08,755 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:46:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2020-12-23 01:46:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-12-23 01:46:08,764 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2020-12-23 01:46:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:08,765 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-12-23 01:46:08,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-12-23 01:46:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:46:08,766 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:08,767 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] [2020-12-23 01:46:08,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:46:08,767 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2020-12-23 01:46:08,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:08,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386407723] [2020-12-23 01:46:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:08,859 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:46:08,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386407723] [2020-12-23 01:46:08,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:08,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:08,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895692455] [2020-12-23 01:46:08,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:08,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:08,862 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2020-12-23 01:46:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:09,499 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2020-12-23 01:46:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:46:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:09,502 INFO L225 Difference]: With dead ends: 520 [2020-12-23 01:46:09,502 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:46:09,502 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:46:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:46:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-12-23 01:46:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2020-12-23 01:46:09,511 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2020-12-23 01:46:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:09,512 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2020-12-23 01:46:09,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2020-12-23 01:46:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 01:46:09,513 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:09,513 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] [2020-12-23 01:46:09,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:46:09,513 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2020-12-23 01:46:09,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:09,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948592132] [2020-12-23 01:46:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:09,587 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:46:09,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948592132] [2020-12-23 01:46:09,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:09,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:09,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662496172] [2020-12-23 01:46:09,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:09,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:09,589 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2020-12-23 01:46:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:10,012 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2020-12-23 01:46:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:10,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 01:46:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:10,014 INFO L225 Difference]: With dead ends: 492 [2020-12-23 01:46:10,014 INFO L226 Difference]: Without dead ends: 261 [2020-12-23 01:46:10,015 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:46:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-23 01:46:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2020-12-23 01:46:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2020-12-23 01:46:10,024 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2020-12-23 01:46:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:10,024 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2020-12-23 01:46:10,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2020-12-23 01:46:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:10,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:10,025 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:46:10,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:46:10,026 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2020-12-23 01:46:10,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:10,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477841827] [2020-12-23 01:46:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:10,101 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:46:10,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477841827] [2020-12-23 01:46:10,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:10,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:10,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600351793] [2020-12-23 01:46:10,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:10,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:10,103 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2020-12-23 01:46:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:10,698 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2020-12-23 01:46:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:10,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2020-12-23 01:46:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:10,701 INFO L225 Difference]: With dead ends: 520 [2020-12-23 01:46:10,701 INFO L226 Difference]: Without dead ends: 289 [2020-12-23 01:46:10,704 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:46:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-12-23 01:46:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2020-12-23 01:46:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-23 01:46:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2020-12-23 01:46:10,715 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2020-12-23 01:46:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:10,716 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2020-12-23 01:46:10,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2020-12-23 01:46:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:10,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:10,717 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:46:10,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:46:10,718 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:10,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2020-12-23 01:46:10,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:10,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424822405] [2020-12-23 01:46:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:10,803 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:46:10,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424822405] [2020-12-23 01:46:10,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:10,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:10,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708812520] [2020-12-23 01:46:10,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:10,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:10,806 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2020-12-23 01:46:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:10,879 INFO L93 Difference]: Finished difference Result 708 states and 1057 transitions. [2020-12-23 01:46:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:10,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:10,882 INFO L225 Difference]: With dead ends: 708 [2020-12-23 01:46:10,882 INFO L226 Difference]: Without dead ends: 477 [2020-12-23 01:46:10,883 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:46:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-12-23 01:46:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2020-12-23 01:46:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2020-12-23 01:46:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 706 transitions. [2020-12-23 01:46:10,901 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 706 transitions. Word has length 106 [2020-12-23 01:46:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:10,902 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 706 transitions. [2020-12-23 01:46:10,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 706 transitions. [2020-12-23 01:46:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:10,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:10,904 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:46:10,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:46:10,904 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -629836579, now seen corresponding path program 1 times [2020-12-23 01:46:10,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:10,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521594144] [2020-12-23 01:46:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:10,952 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:46:10,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521594144] [2020-12-23 01:46:10,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:10,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:10,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728496605] [2020-12-23 01:46:10,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:10,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:10,955 INFO L87 Difference]: Start difference. First operand 477 states and 706 transitions. Second operand 3 states. [2020-12-23 01:46:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:11,014 INFO L93 Difference]: Finished difference Result 962 states and 1427 transitions. [2020-12-23 01:46:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:11,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:11,017 INFO L225 Difference]: With dead ends: 962 [2020-12-23 01:46:11,017 INFO L226 Difference]: Without dead ends: 504 [2020-12-23 01:46:11,018 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:46:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-12-23 01:46:11,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2020-12-23 01:46:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-12-23 01:46:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 741 transitions. [2020-12-23 01:46:11,036 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 741 transitions. Word has length 106 [2020-12-23 01:46:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:11,036 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 741 transitions. [2020-12-23 01:46:11,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 741 transitions. [2020-12-23 01:46:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-23 01:46:11,038 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:11,038 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:46:11,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:46:11,038 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1216112801, now seen corresponding path program 1 times [2020-12-23 01:46:11,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:11,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859422420] [2020-12-23 01:46:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:11,081 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:46:11,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859422420] [2020-12-23 01:46:11,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:11,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:46:11,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16177838] [2020-12-23 01:46:11,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:46:11,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:46:11,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:46:11,083 INFO L87 Difference]: Start difference. First operand 504 states and 741 transitions. Second operand 3 states. [2020-12-23 01:46:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:11,108 INFO L93 Difference]: Finished difference Result 991 states and 1463 transitions. [2020-12-23 01:46:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:46:11,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-12-23 01:46:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:11,112 INFO L225 Difference]: With dead ends: 991 [2020-12-23 01:46:11,112 INFO L226 Difference]: Without dead ends: 506 [2020-12-23 01:46:11,113 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:46:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-12-23 01:46:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2020-12-23 01:46:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-12-23 01:46:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 743 transitions. [2020-12-23 01:46:11,129 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 743 transitions. Word has length 106 [2020-12-23 01:46:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:11,129 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 743 transitions. [2020-12-23 01:46:11,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:46:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 743 transitions. [2020-12-23 01:46:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-23 01:46:11,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:11,131 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:46:11,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:46:11,132 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2020-12-23 01:46:11,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:11,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616039960] [2020-12-23 01:46:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:46:11,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:46:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:46:11,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:46:11,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:46:11,501 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:46:11,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:46:11,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:46:11 BoogieIcfgContainer [2020-12-23 01:46:11,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:46:11,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:46:11,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:46:11,726 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:46:11,727 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:48" (3/4) ... [2020-12-23 01:46:11,735 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:46:11,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:46:11,738 INFO L168 Benchmark]: Toolchain (without parser) took 25413.60 ms. Allocated memory was 151.0 MB in the beginning and 351.3 MB in the end (delta: 200.3 MB). Free memory was 123.5 MB in the beginning and 309.4 MB in the end (delta: -185.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,739 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 132.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:46:11,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1025.11 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 117.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.75 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 113.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,740 INFO L168 Benchmark]: Boogie Preprocessor took 128.32 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 106.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,741 INFO L168 Benchmark]: RCFGBuilder took 1317.87 ms. Allocated memory was 151.0 MB in the beginning and 202.4 MB in the end (delta: 51.4 MB). Free memory was 106.5 MB in the beginning and 148.0 MB in the end (delta: -41.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,741 INFO L168 Benchmark]: TraceAbstraction took 22803.22 ms. Allocated memory was 202.4 MB in the beginning and 351.3 MB in the end (delta: 148.9 MB). Free memory was 147.4 MB in the beginning and 309.9 MB in the end (delta: -162.4 MB). Peak memory consumption was 187.8 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,741 INFO L168 Benchmark]: Witness Printer took 9.84 ms. Allocated memory is still 351.3 MB. Free memory was 309.9 MB in the beginning and 309.4 MB in the end (delta: 526.3 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 01:46:11,744 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.24 ms. Allocated memory is still 151.0 MB. Free memory is still 132.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1025.11 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 117.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 115.75 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 113.4 MB in the end (delta: 4.5 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 128.32 ms. Allocated memory is still 151.0 MB. Free memory was 113.4 MB in the beginning and 106.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1317.87 ms. Allocated memory was 151.0 MB in the beginning and 202.4 MB in the end (delta: 51.4 MB). Free memory was 106.5 MB in the beginning and 148.0 MB in the end (delta: -41.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22803.22 ms. Allocated memory was 202.4 MB in the beginning and 351.3 MB in the end (delta: 148.9 MB). Free memory was 147.4 MB in the beginning and 309.9 MB in the end (delta: -162.4 MB). Peak memory consumption was 187.8 MB. Max. memory is 8.0 GB. * Witness Printer took 9.84 ms. Allocated memory is still 351.3 MB. Free memory was 309.9 MB in the beginning and 309.4 MB in the end (delta: 526.3 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1705]: 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 1123. 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 ; [L1084] unsigned long l ; [L1085] unsigned long Time ; [L1086] unsigned long tmp ; [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 = __VERIFIER_nondet_int() ; [L1097] int tmp___4 = __VERIFIER_nondet_int() ; [L1098] int tmp___5 = __VERIFIER_nondet_int() ; [L1099] int tmp___6 = __VERIFIER_nondet_int() ; [L1100] int tmp___7 ; [L1101] long tmp___8 = __VERIFIER_nondet_long() ; [L1102] int tmp___9 = __VERIFIER_nondet_int() ; [L1103] int tmp___10 = __VERIFIER_nondet_int() ; [L1104] int blastFlag ; [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1557] EXPR s->session [L1557] EXPR s->s3 [L1557] EXPR (s->s3)->tmp.new_cipher [L1557] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1558] COND FALSE !(! tmp___9) [L1564] ret = __VERIFIER_nondet_int() [L1565] COND TRUE blastFlag == 2 [L1566] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1570] COND FALSE !(ret <= 0) [L1575] s->state = 8672 [L1576] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1577] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1664] EXPR s->s3 [L1664] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1664] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1693] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={6:0}] [L1705] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.5s, OverallIterations: 41, TraceHistogramMax: 4, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7515 SDtfs, 2112 SDslu, 10973 SDs, 0 SdLazy, 6885 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 80 SyntacticMatches, 29 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred 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, 40 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3335 ConstructedInterpolants, 0 QuantifiedInterpolants, 763149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 1736/1736 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...