/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_clnt.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:38:23,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:38:23,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:38:23,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:38:23,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:38:23,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:38:23,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:38:23,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:38:23,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:38:23,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:38:23,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:38:23,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:38:23,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:38:23,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:38:23,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:38:23,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:38:23,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:38:23,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:38:23,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:38:23,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:38:23,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:38:23,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:38:23,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:38:23,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:38:23,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:38:23,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:38:23,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:38:23,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:38:23,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:38:23,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:38:23,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:38:23,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:38:23,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:38:23,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:38:23,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:38:23,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:38:23,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:38:23,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:38:23,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:38:23,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:38:23,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:38:23,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:38:23,319 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:38:23,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:38:23,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:38:23,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:38:23,326 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:38:23,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:38:23,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:38:23,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:38:23,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:38:23,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:38:23,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:38:23,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:38:23,329 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:38:23,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:38:23,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:38:23,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:38:23,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:38:23,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:38:23,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:38:23,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:38:23,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:38:23,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:38:23,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:38:23,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:38:23,767 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:38:23,768 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:38:23,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-01-06 11:38:23,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94fba0a63/86099ac801ee4789b14ea8abe7c51f8e/FLAG596655d14 [2021-01-06 11:38:24,679 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:38:24,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-01-06 11:38:24,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94fba0a63/86099ac801ee4789b14ea8abe7c51f8e/FLAG596655d14 [2021-01-06 11:38:24,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94fba0a63/86099ac801ee4789b14ea8abe7c51f8e [2021-01-06 11:38:24,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:38:24,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:38:24,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:24,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:38:24,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:38:24,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229fb4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24, skipping insertion in model container [2021-01-06 11:38:24,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:38:25,023 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[~init~0,GLOBAL] 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_client_data~0,GLOBAL],ssl_connect] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_client_data~0,GLOBAL],get_ssl_method] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] 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~2,] 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[~cb~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[72],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: lhs: VariableLHS[~ret~0,] 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: 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: 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[~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[~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: 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[~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[~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[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[~l~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[#t~mem96,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem96,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem98,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem98,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem100,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem100,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem105,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem105,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem106,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem106,],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: 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~mem114,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem114,],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~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem120,],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[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: 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: lhs: VariableLHS[~ret~0,] 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[~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,] [2021-01-06 11:38:25,518 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_clnt.blast.02.i.cil-1.c[64353,64366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:25,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:25,550 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] 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_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] 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~2,] 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[~cb~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[72],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: lhs: VariableLHS[~ret~0,] 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: 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: 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[~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[~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: 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[~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[~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[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[~l~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[#t~mem96,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem96,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem98,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem98,],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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem100,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem100,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem105,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem105,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem106,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem106,],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: 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~mem114,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem114,],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~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem120,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem120,],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[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: 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: lhs: VariableLHS[~ret~0,] 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[~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,] [2021-01-06 11:38:25,751 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_clnt.blast.02.i.cil-1.c[64353,64366] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:25,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:25,821 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:38:25,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25 WrapperNode [2021-01-06 11:38:25,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:25,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:25,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:38:25,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:38:25,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:25,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:25,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:25,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:38:25,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:38:25,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:38:26,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... [2021-01-06 11:38:26,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:38:26,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:38:26,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:38:26,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:38:26,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:38:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:38:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:38:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:38:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:38:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:38:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:38:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:38:26,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:38:26,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:38:26,541 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:38:27,552 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-06 11:38:27,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-06 11:38:27,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:38:27,565 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:38:27,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:27 BoogieIcfgContainer [2021-01-06 11:38:27,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:38:27,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:38:27,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:38:27,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:38:27,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:38:24" (1/3) ... [2021-01-06 11:38:27,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dfe15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:27, skipping insertion in model container [2021-01-06 11:38:27,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:25" (2/3) ... [2021-01-06 11:38:27,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dfe15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:27, skipping insertion in model container [2021-01-06 11:38:27,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:27" (3/3) ... [2021-01-06 11:38:27,579 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2021-01-06 11:38:27,587 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:38:27,593 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:38:27,613 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:38:27,650 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:38:27,650 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:38:27,650 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:38:27,650 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:38:27,651 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:38:27,651 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:38:27,651 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:38:27,651 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:38:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2021-01-06 11:38:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:38:27,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:27,683 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] [2021-01-06 11:38:27,684 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-01-06 11:38:27,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:27,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344181553] [2021-01-06 11:38:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:38:28,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344181553] [2021-01-06 11:38:28,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:28,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:28,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947630898] [2021-01-06 11:38:28,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:28,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:28,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:28,097 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2021-01-06 11:38:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:28,622 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2021-01-06 11:38:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:28,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-06 11:38:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:28,637 INFO L225 Difference]: With dead ends: 255 [2021-01-06 11:38:28,637 INFO L226 Difference]: Without dead ends: 116 [2021-01-06 11:38:28,641 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 [2021-01-06 11:38:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-01-06 11:38:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-01-06 11:38:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2021-01-06 11:38:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-01-06 11:38:28,691 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-01-06 11:38:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:28,691 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-01-06 11:38:28,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-01-06 11:38:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 11:38:28,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:28,694 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] [2021-01-06 11:38:28,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:38:28,694 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:28,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2021-01-06 11:38:28,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:28,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510393199] [2021-01-06 11:38:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:28,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510393199] [2021-01-06 11:38:28,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:28,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:28,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537627980] [2021-01-06 11:38:28,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:28,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:28,996 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2021-01-06 11:38:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:29,067 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2021-01-06 11:38:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:29,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 11:38:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:29,071 INFO L225 Difference]: With dead ends: 320 [2021-01-06 11:38:29,072 INFO L226 Difference]: Without dead ends: 215 [2021-01-06 11:38:29,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-01-06 11:38:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-01-06 11:38:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2021-01-06 11:38:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2021-01-06 11:38:29,095 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2021-01-06 11:38:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:29,095 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2021-01-06 11:38:29,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2021-01-06 11:38:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 11:38:29,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:29,098 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 11:38:29,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:38:29,099 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2021-01-06 11:38:29,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:29,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566158021] [2021-01-06 11:38:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:29,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566158021] [2021-01-06 11:38:29,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:29,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:29,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647046668] [2021-01-06 11:38:29,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:29,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:29,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:29,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:29,259 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2021-01-06 11:38:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:29,375 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2021-01-06 11:38:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:29,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 11:38:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:29,380 INFO L225 Difference]: With dead ends: 420 [2021-01-06 11:38:29,380 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:38:29,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:38:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-01-06 11:38:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2021-01-06 11:38:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2021-01-06 11:38:29,409 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2021-01-06 11:38:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:29,410 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2021-01-06 11:38:29,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2021-01-06 11:38:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 11:38:29,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:29,414 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2021-01-06 11:38:29,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:38:29,415 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:29,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2021-01-06 11:38:29,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:29,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218263684] [2021-01-06 11:38:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:29,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218263684] [2021-01-06 11:38:29,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:29,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:29,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283987721] [2021-01-06 11:38:29,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:29,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:29,687 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2021-01-06 11:38:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:30,515 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2021-01-06 11:38:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:30,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 11:38:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:30,520 INFO L225 Difference]: With dead ends: 805 [2021-01-06 11:38:30,520 INFO L226 Difference]: Without dead ends: 500 [2021-01-06 11:38:30,522 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 [2021-01-06 11:38:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-01-06 11:38:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2021-01-06 11:38:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2021-01-06 11:38:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2021-01-06 11:38:30,551 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2021-01-06 11:38:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:30,551 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2021-01-06 11:38:30,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2021-01-06 11:38:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 11:38:30,561 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:30,561 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2021-01-06 11:38:30,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:38:30,562 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2021-01-06 11:38:30,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:30,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649288748] [2021-01-06 11:38:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:30,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649288748] [2021-01-06 11:38:30,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:30,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:30,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896949849] [2021-01-06 11:38:30,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:30,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:30,739 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2021-01-06 11:38:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:31,374 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2021-01-06 11:38:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:31,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 11:38:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:31,378 INFO L225 Difference]: With dead ends: 805 [2021-01-06 11:38:31,379 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:31,380 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 [2021-01-06 11:38:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2021-01-06 11:38:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2021-01-06 11:38:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2021-01-06 11:38:31,400 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2021-01-06 11:38:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:31,400 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2021-01-06 11:38:31,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2021-01-06 11:38:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:38:31,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:31,403 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2021-01-06 11:38:31,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:38:31,404 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2021-01-06 11:38:31,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:31,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898266867] [2021-01-06 11:38:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:31,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898266867] [2021-01-06 11:38:31,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:31,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:31,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654887932] [2021-01-06 11:38:31,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:31,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:31,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:31,580 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2021-01-06 11:38:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:32,287 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2021-01-06 11:38:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:32,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 11:38:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:32,293 INFO L225 Difference]: With dead ends: 927 [2021-01-06 11:38:32,293 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:32,294 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 [2021-01-06 11:38:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2021-01-06 11:38:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2021-01-06 11:38:32,316 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2021-01-06 11:38:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:32,317 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2021-01-06 11:38:32,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2021-01-06 11:38:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:32,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:32,322 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2021-01-06 11:38:32,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:38:32,326 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2021-01-06 11:38:32,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:32,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678525284] [2021-01-06 11:38:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:32,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678525284] [2021-01-06 11:38:32,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:32,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:32,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374928105] [2021-01-06 11:38:32,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:32,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:32,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:32,489 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2021-01-06 11:38:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:33,206 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2021-01-06 11:38:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:33,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:38:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:33,211 INFO L225 Difference]: With dead ends: 927 [2021-01-06 11:38:33,212 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 11:38:33,213 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 [2021-01-06 11:38:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 11:38:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-01-06 11:38:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2021-01-06 11:38:33,233 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2021-01-06 11:38:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:33,234 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2021-01-06 11:38:33,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2021-01-06 11:38:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:33,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:33,236 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2021-01-06 11:38:33,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:38:33,237 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2021-01-06 11:38:33,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:33,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415249137] [2021-01-06 11:38:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:33,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415249137] [2021-01-06 11:38:33,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:33,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:33,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962162852] [2021-01-06 11:38:33,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:33,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:33,333 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2021-01-06 11:38:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:34,124 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2021-01-06 11:38:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:34,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:38:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:34,129 INFO L225 Difference]: With dead ends: 927 [2021-01-06 11:38:34,129 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 11:38:34,131 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 [2021-01-06 11:38:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 11:38:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-01-06 11:38:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2021-01-06 11:38:34,147 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2021-01-06 11:38:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:34,148 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2021-01-06 11:38:34,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2021-01-06 11:38:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:34,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:34,150 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2021-01-06 11:38:34,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:38:34,150 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2021-01-06 11:38:34,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:34,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074747867] [2021-01-06 11:38:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:34,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074747867] [2021-01-06 11:38:34,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:34,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:34,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759761305] [2021-01-06 11:38:34,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:34,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:34,289 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2021-01-06 11:38:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:34,770 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2021-01-06 11:38:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:34,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:38:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:34,774 INFO L225 Difference]: With dead ends: 847 [2021-01-06 11:38:34,774 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:34,776 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 [2021-01-06 11:38:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-01-06 11:38:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2021-01-06 11:38:34,791 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2021-01-06 11:38:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:34,791 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2021-01-06 11:38:34,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2021-01-06 11:38:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:38:34,793 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:34,793 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2021-01-06 11:38:34,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:38:34,794 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:34,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:34,795 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2021-01-06 11:38:34,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:34,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056109216] [2021-01-06 11:38:34,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:34,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056109216] [2021-01-06 11:38:34,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:34,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:34,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246536303] [2021-01-06 11:38:34,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:34,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:34,905 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2021-01-06 11:38:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:35,383 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2021-01-06 11:38:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:35,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-06 11:38:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:35,387 INFO L225 Difference]: With dead ends: 847 [2021-01-06 11:38:35,387 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:35,388 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 [2021-01-06 11:38:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-01-06 11:38:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2021-01-06 11:38:35,405 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2021-01-06 11:38:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:35,406 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2021-01-06 11:38:35,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2021-01-06 11:38:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:38:35,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:35,408 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:35,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:38:35,408 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:35,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2021-01-06 11:38:35,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:35,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387816393] [2021-01-06 11:38:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:35,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387816393] [2021-01-06 11:38:35,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:35,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:35,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710893145] [2021-01-06 11:38:35,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:35,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:35,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:35,506 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2021-01-06 11:38:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:36,227 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2021-01-06 11:38:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:36,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:38:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:36,232 INFO L225 Difference]: With dead ends: 927 [2021-01-06 11:38:36,232 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 11:38:36,234 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 [2021-01-06 11:38:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 11:38:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-01-06 11:38:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2021-01-06 11:38:36,250 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2021-01-06 11:38:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:36,251 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2021-01-06 11:38:36,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2021-01-06 11:38:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:38:36,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:36,253 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:36,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:38:36,253 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2021-01-06 11:38:36,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:36,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455729511] [2021-01-06 11:38:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:36,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455729511] [2021-01-06 11:38:36,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:36,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:36,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980917172] [2021-01-06 11:38:36,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:36,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:36,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:36,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:36,375 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2021-01-06 11:38:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:36,933 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2021-01-06 11:38:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:36,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2021-01-06 11:38:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:36,937 INFO L225 Difference]: With dead ends: 847 [2021-01-06 11:38:36,938 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:36,939 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 [2021-01-06 11:38:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-01-06 11:38:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2021-01-06 11:38:36,954 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2021-01-06 11:38:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:36,955 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2021-01-06 11:38:36,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2021-01-06 11:38:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:36,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:36,962 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:36,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:38:36,963 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2021-01-06 11:38:36,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:36,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771653644] [2021-01-06 11:38:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:37,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771653644] [2021-01-06 11:38:37,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:37,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:37,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792938676] [2021-01-06 11:38:37,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:37,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:37,068 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2021-01-06 11:38:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:37,789 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2021-01-06 11:38:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:37,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:37,793 INFO L225 Difference]: With dead ends: 927 [2021-01-06 11:38:37,793 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 11:38:37,795 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 [2021-01-06 11:38:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 11:38:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-01-06 11:38:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2021-01-06 11:38:37,811 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2021-01-06 11:38:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:37,811 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2021-01-06 11:38:37,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2021-01-06 11:38:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:37,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:37,814 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:37,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:38:37,814 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2021-01-06 11:38:37,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:37,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080325985] [2021-01-06 11:38:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:37,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080325985] [2021-01-06 11:38:37,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:37,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:37,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519778774] [2021-01-06 11:38:37,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:37,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:37,902 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2021-01-06 11:38:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:38,705 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2021-01-06 11:38:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:38,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:38,709 INFO L225 Difference]: With dead ends: 783 [2021-01-06 11:38:38,709 INFO L226 Difference]: Without dead ends: 530 [2021-01-06 11:38:38,710 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 [2021-01-06 11:38:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-01-06 11:38:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-01-06 11:38:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2021-01-06 11:38:38,728 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2021-01-06 11:38:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:38,728 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2021-01-06 11:38:38,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2021-01-06 11:38:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:38,730 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:38,731 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:38,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:38:38,731 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2021-01-06 11:38:38,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:38,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501423764] [2021-01-06 11:38:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:38,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501423764] [2021-01-06 11:38:38,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:38,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:38,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452842510] [2021-01-06 11:38:38,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:38,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:38,851 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2021-01-06 11:38:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:39,354 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2021-01-06 11:38:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:39,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:39,359 INFO L225 Difference]: With dead ends: 847 [2021-01-06 11:38:39,359 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:39,360 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 [2021-01-06 11:38:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-01-06 11:38:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2021-01-06 11:38:39,376 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2021-01-06 11:38:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:39,377 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2021-01-06 11:38:39,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2021-01-06 11:38:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:39,379 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:39,380 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:39,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:38:39,380 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2021-01-06 11:38:39,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:39,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244011147] [2021-01-06 11:38:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:39,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244011147] [2021-01-06 11:38:39,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:39,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:39,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033440348] [2021-01-06 11:38:39,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:39,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:39,472 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2021-01-06 11:38:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:40,085 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2021-01-06 11:38:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:40,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:40,089 INFO L225 Difference]: With dead ends: 703 [2021-01-06 11:38:40,089 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:38:40,091 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 [2021-01-06 11:38:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:38:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-01-06 11:38:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2021-01-06 11:38:40,108 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2021-01-06 11:38:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:40,108 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2021-01-06 11:38:40,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2021-01-06 11:38:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:40,110 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:40,110 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:40,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:38:40,110 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2021-01-06 11:38:40,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:40,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362272546] [2021-01-06 11:38:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:40,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362272546] [2021-01-06 11:38:40,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:40,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:40,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808230655] [2021-01-06 11:38:40,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:40,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:40,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:40,205 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2021-01-06 11:38:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:40,914 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2021-01-06 11:38:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:40,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:40,919 INFO L225 Difference]: With dead ends: 909 [2021-01-06 11:38:40,920 INFO L226 Difference]: Without dead ends: 512 [2021-01-06 11:38:40,921 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 [2021-01-06 11:38:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-01-06 11:38:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2021-01-06 11:38:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2021-01-06 11:38:40,940 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2021-01-06 11:38:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:40,940 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2021-01-06 11:38:40,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2021-01-06 11:38:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:40,942 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:40,943 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:40,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:38:40,943 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2021-01-06 11:38:40,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:40,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797797664] [2021-01-06 11:38:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:41,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797797664] [2021-01-06 11:38:41,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:41,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:41,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557772589] [2021-01-06 11:38:41,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:41,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:41,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:41,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:41,038 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2021-01-06 11:38:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:41,619 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2021-01-06 11:38:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:41,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:41,623 INFO L225 Difference]: With dead ends: 758 [2021-01-06 11:38:41,624 INFO L226 Difference]: Without dead ends: 505 [2021-01-06 11:38:41,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 [2021-01-06 11:38:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-01-06 11:38:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2021-01-06 11:38:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2021-01-06 11:38:41,640 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2021-01-06 11:38:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:41,640 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2021-01-06 11:38:41,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2021-01-06 11:38:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:41,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:41,642 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:41,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:38:41,643 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2021-01-06 11:38:41,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:41,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600732972] [2021-01-06 11:38:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:41,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600732972] [2021-01-06 11:38:41,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:41,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:41,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223556541] [2021-01-06 11:38:41,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:41,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:41,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:41,721 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2021-01-06 11:38:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:42,202 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2021-01-06 11:38:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:42,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:42,205 INFO L225 Difference]: With dead ends: 829 [2021-01-06 11:38:42,205 INFO L226 Difference]: Without dead ends: 432 [2021-01-06 11:38:42,206 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 [2021-01-06 11:38:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-01-06 11:38:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2021-01-06 11:38:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2021-01-06 11:38:42,221 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2021-01-06 11:38:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:42,221 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2021-01-06 11:38:42,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2021-01-06 11:38:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:42,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:42,223 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:42,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:38:42,224 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:42,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2021-01-06 11:38:42,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:42,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150899504] [2021-01-06 11:38:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:42,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150899504] [2021-01-06 11:38:42,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:42,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:42,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906139176] [2021-01-06 11:38:42,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:42,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:42,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:42,302 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2021-01-06 11:38:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:42,716 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2021-01-06 11:38:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:42,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:42,719 INFO L225 Difference]: With dead ends: 678 [2021-01-06 11:38:42,719 INFO L226 Difference]: Without dead ends: 425 [2021-01-06 11:38:42,720 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 [2021-01-06 11:38:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-01-06 11:38:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2021-01-06 11:38:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2021-01-06 11:38:42,735 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2021-01-06 11:38:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:42,735 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2021-01-06 11:38:42,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2021-01-06 11:38:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:38:42,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:42,737 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:42,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:38:42,738 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2021-01-06 11:38:42,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:42,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178653308] [2021-01-06 11:38:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:42,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178653308] [2021-01-06 11:38:42,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:42,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:42,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125616173] [2021-01-06 11:38:42,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:42,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:42,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:42,819 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2021-01-06 11:38:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:43,463 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2021-01-06 11:38:43,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:43,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:38:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:43,470 INFO L225 Difference]: With dead ends: 902 [2021-01-06 11:38:43,471 INFO L226 Difference]: Without dead ends: 505 [2021-01-06 11:38:43,472 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 [2021-01-06 11:38:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-01-06 11:38:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2021-01-06 11:38:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2021-01-06 11:38:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2021-01-06 11:38:43,485 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2021-01-06 11:38:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:43,486 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2021-01-06 11:38:43,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2021-01-06 11:38:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:38:43,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:43,488 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:43,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:38:43,488 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2021-01-06 11:38:43,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:43,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703304022] [2021-01-06 11:38:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 11:38:43,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703304022] [2021-01-06 11:38:43,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:43,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:43,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171114134] [2021-01-06 11:38:43,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:43,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:43,590 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2021-01-06 11:38:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:43,688 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2021-01-06 11:38:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:43,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 11:38:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:43,692 INFO L225 Difference]: With dead ends: 806 [2021-01-06 11:38:43,693 INFO L226 Difference]: Without dead ends: 555 [2021-01-06 11:38:43,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-01-06 11:38:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-01-06 11:38:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2021-01-06 11:38:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2021-01-06 11:38:43,710 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 89 [2021-01-06 11:38:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:43,710 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2021-01-06 11:38:43,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2021-01-06 11:38:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:38:43,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:43,713 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:43,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:38:43,713 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2021-01-06 11:38:43,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:43,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422731314] [2021-01-06 11:38:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-06 11:38:43,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422731314] [2021-01-06 11:38:43,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:43,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:43,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101279974] [2021-01-06 11:38:43,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:43,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:43,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:43,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:43,816 INFO L87 Difference]: Start difference. First operand 555 states and 805 transitions. Second operand 3 states. [2021-01-06 11:38:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:43,864 INFO L93 Difference]: Finished difference Result 1103 states and 1606 transitions. [2021-01-06 11:38:43,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:43,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 11:38:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:43,869 INFO L225 Difference]: With dead ends: 1103 [2021-01-06 11:38:43,869 INFO L226 Difference]: Without dead ends: 704 [2021-01-06 11:38:43,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-01-06 11:38:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-01-06 11:38:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2021-01-06 11:38:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1023 transitions. [2021-01-06 11:38:43,892 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1023 transitions. Word has length 91 [2021-01-06 11:38:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:43,892 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 1023 transitions. [2021-01-06 11:38:43,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1023 transitions. [2021-01-06 11:38:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 11:38:43,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:43,895 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2021-01-06 11:38:43,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:38:43,895 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2021-01-06 11:38:43,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:43,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520003420] [2021-01-06 11:38:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:38:44,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:38:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:38:44,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:38:44,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:38:44,415 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:38:44,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:38:44,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:38:44 BoogieIcfgContainer [2021-01-06 11:38:44,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:38:44,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:38:44,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:38:44,590 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:38:44,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:27" (3/4) ... [2021-01-06 11:38:44,595 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:38:44,595 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:38:44,598 INFO L168 Benchmark]: Toolchain (without parser) took 19652.60 ms. Allocated memory was 152.0 MB in the beginning and 285.2 MB in the end (delta: 133.2 MB). Free memory was 125.7 MB in the beginning and 123.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 136.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,598 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 152.0 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:38:44,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 875.12 ms. Allocated memory is still 152.0 MB. Free memory was 125.5 MB in the beginning and 128.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 34.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.98 ms. Allocated memory is still 152.0 MB. Free memory was 128.0 MB in the beginning and 123.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,600 INFO L168 Benchmark]: Boogie Preprocessor took 164.95 ms. Allocated memory is still 152.0 MB. Free memory was 123.3 MB in the beginning and 117.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,600 INFO L168 Benchmark]: RCFGBuilder took 1417.40 ms. Allocated memory was 152.0 MB in the beginning and 197.1 MB in the end (delta: 45.1 MB). Free memory was 117.0 MB in the beginning and 132.1 MB in the end (delta: -15.0 MB). Peak memory consumption was 52.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,601 INFO L168 Benchmark]: TraceAbstraction took 17019.19 ms. Allocated memory was 197.1 MB in the beginning and 285.2 MB in the end (delta: 88.1 MB). Free memory was 131.5 MB in the beginning and 123.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 95.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,602 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 285.2 MB. Free memory was 123.5 MB in the beginning and 123.0 MB in the end (delta: 526.3 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:44,605 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.21 ms. Allocated memory is still 152.0 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 875.12 ms. Allocated memory is still 152.0 MB. Free memory was 125.5 MB in the beginning and 128.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 34.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 155.98 ms. Allocated memory is still 152.0 MB. Free memory was 128.0 MB in the beginning and 123.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 164.95 ms. Allocated memory is still 152.0 MB. Free memory was 123.3 MB in the beginning and 117.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1417.40 ms. Allocated memory was 152.0 MB in the beginning and 197.1 MB in the end (delta: 45.1 MB). Free memory was 117.0 MB in the beginning and 132.1 MB in the end (delta: -15.0 MB). Peak memory consumption was 52.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17019.19 ms. Allocated memory was 197.1 MB in the beginning and 285.2 MB in the end (delta: 88.1 MB). Free memory was 131.5 MB in the beginning and 123.5 MB in the end (delta: 8.0 MB). Peak memory consumption was 95.6 MB. Max. memory is 8.0 GB. * Witness Printer took 5.21 ms. Allocated memory is still 285.2 MB. Free memory was 123.5 MB in the beginning and 123.0 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: 1643]: 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 1338. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={5:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf ; [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 = __VERIFIER_nondet_int() ; [L1098] int tmp___8 = __VERIFIER_nondet_int() ; [L1099] long tmp___9 = __VERIFIER_nondet_long() ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={5:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={5:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={5:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={5:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={5:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={5:0}] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [init=1, SSLv3_client_data={5:0}] [L1310] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND TRUE s->state == 4384 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] blastFlag = 2 VAL [init=1, SSLv3_client_data={5:0}] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [init=1, SSLv3_client_data={5:0}] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [init=1, SSLv3_client_data={5:0}] [L1334] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={5:0}] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [init=1, SSLv3_client_data={5:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={5:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={5:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={5:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={5:0}] [L1643] reach_error() VAL [init=1, SSLv3_client_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.7s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5042 SDtfs, 1763 SDslu, 6301 SDs, 0 SdLazy, 3592 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=704occurred in iteration=23, 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, 23 MinimizatonAttempts, 1480 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 374650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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...