/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:42:36,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:42:36,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:42:37,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:42:37,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:42:37,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:42:37,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:42:37,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:42:37,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:42:37,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:42:37,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:42:37,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:42:37,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:42:37,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:42:37,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:42:37,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:42:37,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:42:37,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:42:37,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:42:37,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:42:37,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:42:37,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:42:37,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:42:37,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:42:37,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:42:37,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:42:37,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:42:37,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:42:37,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:42:37,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:42:37,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:42:37,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:42:37,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:42:37,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:42:37,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:42:37,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:42:37,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:42:37,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:42:37,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:42:37,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:42:37,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:42:37,067 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:42:37,096 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:42:37,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:42:37,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:42:37,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:42:37,099 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:42:37,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:42:37,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:42:37,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:42:37,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:42:37,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:42:37,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:42:37,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:42:37,101 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:42:37,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:42:37,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:42:37,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:42:37,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:42:37,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:42:37,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:42:37,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:42:37,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:42:37,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:42:37,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:42:37,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:42:37,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:42:37,104 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:42:37,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:42:37,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:42:37,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:42:37,643 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:42:37,645 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:42:37,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-01-06 11:42:37,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/849d41a03/8bca8ffa90b144529ac9c6e40d27e139/FLAG69205efbc [2021-01-06 11:42:38,695 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:42:38,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-01-06 11:42:38,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/849d41a03/8bca8ffa90b144529ac9c6e40d27e139/FLAG69205efbc [2021-01-06 11:42:38,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/849d41a03/8bca8ffa90b144529ac9c6e40d27e139 [2021-01-06 11:42:38,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:42:38,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:42:38,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:42:38,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:42:38,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:42:38,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:42:38" (1/1) ... [2021-01-06 11:42:38,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38614c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:38, skipping insertion in model container [2021-01-06 11:42:38,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:42:38" (1/1) ... [2021-01-06 11:42:38,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:42:38,926 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:42:39,360 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:42:39,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:42:39,413 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: 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[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:42:39,566 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:42:39,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:42:39,622 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:42:39,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39 WrapperNode [2021-01-06 11:42:39,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:42:39,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:42:39,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:42:39,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:42:39,636 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:42:39" (1/1) ... [2021-01-06 11:42:39,662 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:42:39" (1/1) ... [2021-01-06 11:42:39,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:42:39,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:42:39,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:42:39,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:42:39,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (1/1) ... [2021-01-06 11:42:39,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:42:39,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:42:39,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:42:39,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:42:39,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (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:42:40,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:42:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:42:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:42:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:42:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:42:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:42:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:42:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:42:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:42:40,374 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:42:41,274 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:42:41,274 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:42:41,286 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:42:41,286 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:42:41,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:42:41 BoogieIcfgContainer [2021-01-06 11:42:41,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:42:41,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:42:41,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:42:41,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:42:41,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:42:38" (1/3) ... [2021-01-06 11:42:41,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758a8637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:42:41, skipping insertion in model container [2021-01-06 11:42:41,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:42:39" (2/3) ... [2021-01-06 11:42:41,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758a8637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:42:41, skipping insertion in model container [2021-01-06 11:42:41,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:42:41" (3/3) ... [2021-01-06 11:42:41,299 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-01-06 11:42:41,306 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:42:41,312 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:42:41,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:42:41,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:42:41,364 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:42:41,364 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:42:41,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:42:41,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:42:41,364 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:42:41,365 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:42:41,365 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:42:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 11:42:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:42:41,396 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:41,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:41,398 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2021-01-06 11:42:41,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:41,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086956376] [2021-01-06 11:42:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:41,831 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:42:41,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086956376] [2021-01-06 11:42:41,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:41,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:41,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049718354] [2021-01-06 11:42:41,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:41,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:41,869 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2021-01-06 11:42:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:42,564 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2021-01-06 11:42:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:42,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:42:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:42,582 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:42:42,582 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:42:42,586 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:42:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:42:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:42:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2021-01-06 11:42:42,645 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2021-01-06 11:42:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:42,645 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2021-01-06 11:42:42,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2021-01-06 11:42:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:42:42,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:42,649 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:42,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:42:42,650 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2021-01-06 11:42:42,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:42,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041540551] [2021-01-06 11:42:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:42,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041540551] [2021-01-06 11:42:42,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:42,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:42,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060328501] [2021-01-06 11:42:42,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:42,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:42,867 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2021-01-06 11:42:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:43,270 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2021-01-06 11:42:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:43,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-01-06 11:42:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:43,272 INFO L225 Difference]: With dead ends: 290 [2021-01-06 11:42:43,273 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:42:43,274 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:42:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:42:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:42:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2021-01-06 11:42:43,287 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2021-01-06 11:42:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:43,288 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2021-01-06 11:42:43,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2021-01-06 11:42:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:42:43,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:43,291 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:43,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:42:43,292 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2021-01-06 11:42:43,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:43,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833084914] [2021-01-06 11:42:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:43,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833084914] [2021-01-06 11:42:43,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:43,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:43,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366108458] [2021-01-06 11:42:43,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:43,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:43,456 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2021-01-06 11:42:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:43,839 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2021-01-06 11:42:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:43,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:42:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:43,842 INFO L225 Difference]: With dead ends: 289 [2021-01-06 11:42:43,842 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 11:42:43,843 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:42:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 11:42:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-01-06 11:42:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2021-01-06 11:42:43,856 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2021-01-06 11:42:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:43,857 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2021-01-06 11:42:43,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2021-01-06 11:42:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:42:43,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:43,864 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:43,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:42:43,864 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2021-01-06 11:42:43,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:43,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48022151] [2021-01-06 11:42:43,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:44,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48022151] [2021-01-06 11:42:44,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:44,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:44,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545188606] [2021-01-06 11:42:44,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:44,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:44,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:44,005 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2021-01-06 11:42:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:44,346 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2021-01-06 11:42:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:44,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:42:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:44,348 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:42:44,349 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:42:44,350 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:42:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:42:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-01-06 11:42:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2021-01-06 11:42:44,373 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2021-01-06 11:42:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:44,373 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2021-01-06 11:42:44,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2021-01-06 11:42:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:42:44,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:44,377 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:44,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:42:44,378 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2021-01-06 11:42:44,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:44,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21134142] [2021-01-06 11:42:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:44,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21134142] [2021-01-06 11:42:44,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:44,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:44,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043893512] [2021-01-06 11:42:44,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:44,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:44,509 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2021-01-06 11:42:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:44,890 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2021-01-06 11:42:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:44,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:42:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:44,892 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:42:44,892 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:42:44,893 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:42:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:42:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:42:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2021-01-06 11:42:44,901 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2021-01-06 11:42:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:44,902 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2021-01-06 11:42:44,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2021-01-06 11:42:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:42:44,903 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:44,903 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:44,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:42:44,904 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2021-01-06 11:42:44,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:44,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601143462] [2021-01-06 11:42:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:44,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601143462] [2021-01-06 11:42:44,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:44,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:44,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892235635] [2021-01-06 11:42:44,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:44,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:44,971 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2021-01-06 11:42:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:45,366 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2021-01-06 11:42:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:45,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:42:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:45,368 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:42:45,369 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:42:45,370 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:42:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:42:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:42:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2021-01-06 11:42:45,378 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2021-01-06 11:42:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:45,378 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2021-01-06 11:42:45,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2021-01-06 11:42:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:42:45,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:45,380 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:45,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:42:45,381 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2021-01-06 11:42:45,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:45,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539019779] [2021-01-06 11:42:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:45,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539019779] [2021-01-06 11:42:45,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:45,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:45,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132929119] [2021-01-06 11:42:45,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:45,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:45,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:45,454 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2021-01-06 11:42:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:45,813 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2021-01-06 11:42:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:45,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2021-01-06 11:42:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:45,816 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:42:45,816 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:42:45,816 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:42:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:42:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:42:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2021-01-06 11:42:45,823 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2021-01-06 11:42:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:45,824 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2021-01-06 11:42:45,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-01-06 11:42:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:42:45,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:45,825 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:45,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:42:45,826 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2021-01-06 11:42:45,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:45,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252744844] [2021-01-06 11:42:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:45,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252744844] [2021-01-06 11:42:45,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:45,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:45,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481671091] [2021-01-06 11:42:45,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:45,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:45,888 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2021-01-06 11:42:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:46,250 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2021-01-06 11:42:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:46,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 11:42:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:46,252 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:42:46,253 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:42:46,253 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:42:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:42:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:42:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-01-06 11:42:46,262 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2021-01-06 11:42:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:46,263 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-01-06 11:42:46,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-01-06 11:42:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:42:46,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:46,266 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:46,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:42:46,266 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:46,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2021-01-06 11:42:46,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:46,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122492820] [2021-01-06 11:42:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:46,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122492820] [2021-01-06 11:42:46,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:46,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:46,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88258352] [2021-01-06 11:42:46,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:46,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:46,393 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2021-01-06 11:42:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:46,683 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2021-01-06 11:42:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:46,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:42:46,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:46,685 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:42:46,685 INFO L226 Difference]: Without dead ends: 149 [2021-01-06 11:42:46,686 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:42:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-01-06 11:42:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-01-06 11:42:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:42:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2021-01-06 11:42:46,692 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2021-01-06 11:42:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:46,692 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2021-01-06 11:42:46,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2021-01-06 11:42:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:42:46,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:46,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:46,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:42:46,694 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2021-01-06 11:42:46,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:46,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804162063] [2021-01-06 11:42:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:46,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804162063] [2021-01-06 11:42:46,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:46,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:46,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096689085] [2021-01-06 11:42:46,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:46,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:46,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:46,826 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2021-01-06 11:42:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:47,165 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-01-06 11:42:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:47,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:42:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:47,167 INFO L225 Difference]: With dead ends: 316 [2021-01-06 11:42:47,168 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:42:47,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:42:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:42:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2021-01-06 11:42:47,178 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2021-01-06 11:42:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:47,179 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2021-01-06 11:42:47,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2021-01-06 11:42:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 11:42:47,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:47,180 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:47,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:42:47,181 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2021-01-06 11:42:47,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:47,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477827951] [2021-01-06 11:42:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:47,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477827951] [2021-01-06 11:42:47,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:47,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:47,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032671433] [2021-01-06 11:42:47,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:47,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:47,253 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2021-01-06 11:42:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:47,607 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2021-01-06 11:42:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:47,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 11:42:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:47,610 INFO L225 Difference]: With dead ends: 338 [2021-01-06 11:42:47,610 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:42:47,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:42:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:42:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-01-06 11:42:47,617 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2021-01-06 11:42:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:47,617 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-01-06 11:42:47,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-01-06 11:42:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:42:47,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:47,619 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:47,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:42:47,619 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2021-01-06 11:42:47,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:47,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147925043] [2021-01-06 11:42:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:47,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147925043] [2021-01-06 11:42:47,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:47,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:47,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122109420] [2021-01-06 11:42:47,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:47,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:47,694 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2021-01-06 11:42:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:48,054 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2021-01-06 11:42:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:48,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:42:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:48,057 INFO L225 Difference]: With dead ends: 337 [2021-01-06 11:42:48,057 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 11:42:48,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 11:42:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2021-01-06 11:42:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2021-01-06 11:42:48,065 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2021-01-06 11:42:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:48,065 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2021-01-06 11:42:48,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2021-01-06 11:42:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:42:48,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:48,066 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:48,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:42:48,067 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2021-01-06 11:42:48,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:48,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785448177] [2021-01-06 11:42:48,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:48,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785448177] [2021-01-06 11:42:48,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:48,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:48,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67806605] [2021-01-06 11:42:48,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:48,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:48,133 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2021-01-06 11:42:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:48,480 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2021-01-06 11:42:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:48,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:42:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:48,482 INFO L225 Difference]: With dead ends: 335 [2021-01-06 11:42:48,487 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:42:48,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:42:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2021-01-06 11:42:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2021-01-06 11:42:48,501 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2021-01-06 11:42:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:48,501 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2021-01-06 11:42:48,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2021-01-06 11:42:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:42:48,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:48,504 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:48,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:42:48,505 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2021-01-06 11:42:48,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:48,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326527445] [2021-01-06 11:42:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:48,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326527445] [2021-01-06 11:42:48,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:48,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:48,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603327170] [2021-01-06 11:42:48,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:48,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:48,583 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2021-01-06 11:42:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:48,912 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2021-01-06 11:42:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:48,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:42:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:48,914 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:42:48,914 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:42:48,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:42:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:42:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2021-01-06 11:42:48,921 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2021-01-06 11:42:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:48,922 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2021-01-06 11:42:48,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2021-01-06 11:42:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:42:48,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:48,923 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:48,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:42:48,923 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2021-01-06 11:42:48,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:48,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101723525] [2021-01-06 11:42:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:48,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101723525] [2021-01-06 11:42:48,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:48,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:48,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127623084] [2021-01-06 11:42:48,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:48,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:48,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:48,978 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2021-01-06 11:42:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:49,303 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-01-06 11:42:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:49,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:42:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:49,305 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:42:49,305 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:42:49,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:42:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:42:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-01-06 11:42:49,313 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2021-01-06 11:42:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:49,313 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-01-06 11:42:49,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2021-01-06 11:42:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 11:42:49,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:49,315 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:49,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:42:49,315 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:49,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2021-01-06 11:42:49,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:49,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526918391] [2021-01-06 11:42:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:49,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526918391] [2021-01-06 11:42:49,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:49,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:49,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407649238] [2021-01-06 11:42:49,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:49,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:49,375 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2021-01-06 11:42:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:49,700 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2021-01-06 11:42:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:49,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 11:42:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:49,702 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:42:49,702 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:42:49,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:42:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:42:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-01-06 11:42:49,709 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2021-01-06 11:42:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:49,709 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-01-06 11:42:49,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2021-01-06 11:42:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:42:49,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:49,710 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:49,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:42:49,711 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2021-01-06 11:42:49,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:49,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980445153] [2021-01-06 11:42:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:49,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980445153] [2021-01-06 11:42:49,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:49,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:49,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934298094] [2021-01-06 11:42:49,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:49,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:49,764 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2021-01-06 11:42:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:50,065 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2021-01-06 11:42:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:50,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 11:42:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:50,068 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:42:50,069 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:42:50,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:42:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:42:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2021-01-06 11:42:50,076 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2021-01-06 11:42:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:50,076 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2021-01-06 11:42:50,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2021-01-06 11:42:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 11:42:50,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:50,078 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:50,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:42:50,078 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2021-01-06 11:42:50,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:50,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880725210] [2021-01-06 11:42:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:42:50,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880725210] [2021-01-06 11:42:50,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:50,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:50,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183425200] [2021-01-06 11:42:50,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:50,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:50,142 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2021-01-06 11:42:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:50,467 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2021-01-06 11:42:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:50,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 11:42:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:50,470 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:42:50,470 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:42:50,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:42:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-01-06 11:42:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:42:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2021-01-06 11:42:50,478 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2021-01-06 11:42:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:50,479 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2021-01-06 11:42:50,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2021-01-06 11:42:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:42:50,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:50,480 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:50,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:42:50,480 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2021-01-06 11:42:50,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:50,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902292440] [2021-01-06 11:42:50,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:50,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902292440] [2021-01-06 11:42:50,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:50,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:50,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832565451] [2021-01-06 11:42:50,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:50,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:50,587 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2021-01-06 11:42:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:51,242 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2021-01-06 11:42:51,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:51,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:42:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:51,245 INFO L225 Difference]: With dead ends: 424 [2021-01-06 11:42:51,246 INFO L226 Difference]: Without dead ends: 275 [2021-01-06 11:42:51,247 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:42:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-01-06 11:42:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2021-01-06 11:42:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 11:42:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2021-01-06 11:42:51,257 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2021-01-06 11:42:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:51,257 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2021-01-06 11:42:51,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2021-01-06 11:42:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:42:51,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:51,259 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:51,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:42:51,259 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:51,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2021-01-06 11:42:51,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:51,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117102928] [2021-01-06 11:42:51,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:51,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117102928] [2021-01-06 11:42:51,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:51,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:51,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738215640] [2021-01-06 11:42:51,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:51,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:51,360 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2021-01-06 11:42:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:51,882 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2021-01-06 11:42:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:51,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:42:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:51,886 INFO L225 Difference]: With dead ends: 427 [2021-01-06 11:42:51,886 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 11:42:51,887 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:42:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 11:42:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2021-01-06 11:42:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-06 11:42:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-01-06 11:42:51,895 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2021-01-06 11:42:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:51,896 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-01-06 11:42:51,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2021-01-06 11:42:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:42:51,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:51,897 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:51,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:42:51,898 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2021-01-06 11:42:51,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:51,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280032054] [2021-01-06 11:42:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:51,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280032054] [2021-01-06 11:42:51,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:51,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:51,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146193217] [2021-01-06 11:42:51,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:51,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:51,982 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2021-01-06 11:42:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:52,507 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2021-01-06 11:42:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:52,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:42:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:52,510 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:42:52,510 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:42:52,511 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:42:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:42:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2021-01-06 11:42:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 11:42:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2021-01-06 11:42:52,520 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2021-01-06 11:42:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:52,521 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2021-01-06 11:42:52,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2021-01-06 11:42:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:42:52,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:52,523 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:52,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:42:52,523 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2021-01-06 11:42:52,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:52,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326727637] [2021-01-06 11:42:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:52,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326727637] [2021-01-06 11:42:52,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:52,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:52,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335406267] [2021-01-06 11:42:52,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:52,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:52,618 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2021-01-06 11:42:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:53,121 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2021-01-06 11:42:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:53,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:42:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:53,124 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:42:53,125 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 11:42:53,126 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:42:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 11:42:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2021-01-06 11:42:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-01-06 11:42:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2021-01-06 11:42:53,139 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2021-01-06 11:42:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:53,139 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2021-01-06 11:42:53,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2021-01-06 11:42:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 11:42:53,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:53,141 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:53,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:42:53,141 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2021-01-06 11:42:53,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:53,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729620544] [2021-01-06 11:42:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:53,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729620544] [2021-01-06 11:42:53,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:53,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:53,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505384091] [2021-01-06 11:42:53,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:53,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:53,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:53,244 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2021-01-06 11:42:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:53,757 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2021-01-06 11:42:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:53,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 11:42:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:53,760 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:42:53,760 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:42:53,761 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:42:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:42:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-01-06 11:42:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2021-01-06 11:42:53,768 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2021-01-06 11:42:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:53,769 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2021-01-06 11:42:53,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2021-01-06 11:42:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:42:53,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:53,770 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:53,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:42:53,770 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2021-01-06 11:42:53,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:53,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904941992] [2021-01-06 11:42:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:53,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904941992] [2021-01-06 11:42:53,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:53,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:53,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908373300] [2021-01-06 11:42:53,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:53,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:53,849 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2021-01-06 11:42:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:54,321 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2021-01-06 11:42:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:54,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:42:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:54,324 INFO L225 Difference]: With dead ends: 498 [2021-01-06 11:42:54,324 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:42:54,325 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:42:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:42:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-01-06 11:42:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2021-01-06 11:42:54,332 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2021-01-06 11:42:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:54,332 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2021-01-06 11:42:54,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2021-01-06 11:42:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:42:54,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:54,334 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:54,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:42:54,334 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2021-01-06 11:42:54,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:54,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512170876] [2021-01-06 11:42:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:54,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512170876] [2021-01-06 11:42:54,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:54,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:54,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820744026] [2021-01-06 11:42:54,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:54,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:54,401 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2021-01-06 11:42:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:54,791 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2021-01-06 11:42:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:54,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:42:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:54,794 INFO L225 Difference]: With dead ends: 475 [2021-01-06 11:42:54,794 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 11:42:54,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:42:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 11:42:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2021-01-06 11:42:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2021-01-06 11:42:54,802 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2021-01-06 11:42:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:54,802 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2021-01-06 11:42:54,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2021-01-06 11:42:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:54,803 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:54,803 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:54,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:42:54,804 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2021-01-06 11:42:54,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:54,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335253320] [2021-01-06 11:42:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:54,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335253320] [2021-01-06 11:42:54,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:54,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:54,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306689333] [2021-01-06 11:42:54,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:54,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:54,872 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2021-01-06 11:42:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:55,338 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2021-01-06 11:42:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:55,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:42:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:55,340 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:42:55,340 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:42:55,341 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:42:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:42:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2021-01-06 11:42:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2021-01-06 11:42:55,348 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2021-01-06 11:42:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:55,348 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2021-01-06 11:42:55,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2021-01-06 11:42:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:55,349 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:55,350 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:55,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:42:55,350 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2021-01-06 11:42:55,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:55,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414416909] [2021-01-06 11:42:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:55,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414416909] [2021-01-06 11:42:55,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:55,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:55,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92610793] [2021-01-06 11:42:55,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:55,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:55,424 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2021-01-06 11:42:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:55,911 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2021-01-06 11:42:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:55,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:42:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:55,914 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:42:55,914 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 11:42:55,915 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:42:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 11:42:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2021-01-06 11:42:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2021-01-06 11:42:55,922 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2021-01-06 11:42:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:55,922 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2021-01-06 11:42:55,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2021-01-06 11:42:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:55,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:55,923 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:55,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:42:55,924 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:55,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2021-01-06 11:42:55,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:55,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898937381] [2021-01-06 11:42:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:55,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898937381] [2021-01-06 11:42:55,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:55,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:55,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730954843] [2021-01-06 11:42:55,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:55,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:55,989 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2021-01-06 11:42:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:56,395 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2021-01-06 11:42:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:56,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:42:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:56,399 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:42:56,399 INFO L226 Difference]: Without dead ends: 279 [2021-01-06 11:42:56,400 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:42:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-01-06 11:42:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2021-01-06 11:42:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:42:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2021-01-06 11:42:56,406 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2021-01-06 11:42:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:56,406 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2021-01-06 11:42:56,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2021-01-06 11:42:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:56,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:56,407 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:56,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:42:56,408 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2021-01-06 11:42:56,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:56,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022681144] [2021-01-06 11:42:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:42:56,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022681144] [2021-01-06 11:42:56,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:56,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:42:56,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230172323] [2021-01-06 11:42:56,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:42:56,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:56,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:42:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:42:56,481 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2021-01-06 11:42:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:56,972 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2021-01-06 11:42:56,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:42:56,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 11:42:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:56,975 INFO L225 Difference]: With dead ends: 470 [2021-01-06 11:42:56,975 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:42:56,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:42:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:42:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-01-06 11:42:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2021-01-06 11:42:56,985 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2021-01-06 11:42:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:56,985 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2021-01-06 11:42:56,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:42:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2021-01-06 11:42:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:56,986 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:56,987 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:56,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:42:56,987 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2021-01-06 11:42:56,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:56,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288407959] [2021-01-06 11:42:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:57,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288407959] [2021-01-06 11:42:57,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:57,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:57,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149509086] [2021-01-06 11:42:57,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:57,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:57,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:57,055 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2021-01-06 11:42:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:57,433 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2021-01-06 11:42:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:57,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:42:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:57,436 INFO L225 Difference]: With dead ends: 512 [2021-01-06 11:42:57,436 INFO L226 Difference]: Without dead ends: 277 [2021-01-06 11:42:57,437 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:42:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-06 11:42:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2021-01-06 11:42:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2021-01-06 11:42:57,444 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2021-01-06 11:42:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:57,445 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2021-01-06 11:42:57,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2021-01-06 11:42:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:42:57,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:57,446 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:57,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:42:57,447 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:57,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2021-01-06 11:42:57,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:57,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781946032] [2021-01-06 11:42:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:57,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781946032] [2021-01-06 11:42:57,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:57,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:57,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082811620] [2021-01-06 11:42:57,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:57,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:57,515 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2021-01-06 11:42:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:57,903 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2021-01-06 11:42:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:57,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:42:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:57,906 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:42:57,907 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:42:57,908 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:42:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:42:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:42:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2021-01-06 11:42:57,916 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2021-01-06 11:42:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:57,916 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2021-01-06 11:42:57,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2021-01-06 11:42:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:42:57,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:57,918 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:57,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:42:57,918 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2021-01-06 11:42:57,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:57,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975668640] [2021-01-06 11:42:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:57,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975668640] [2021-01-06 11:42:57,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:57,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:57,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109232332] [2021-01-06 11:42:57,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:57,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:57,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:57,980 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2021-01-06 11:42:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:58,477 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2021-01-06 11:42:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:58,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:42:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:58,479 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:42:58,480 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:42:58,482 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:42:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:42:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:42:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-01-06 11:42:58,497 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2021-01-06 11:42:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:58,498 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-01-06 11:42:58,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-01-06 11:42:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:42:58,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:58,499 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:58,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:42:58,500 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2021-01-06 11:42:58,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:58,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112214975] [2021-01-06 11:42:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:58,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112214975] [2021-01-06 11:42:58,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:58,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:58,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556685378] [2021-01-06 11:42:58,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:58,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:58,599 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2021-01-06 11:42:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:58,984 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-01-06 11:42:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:58,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:42:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:58,986 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:42:58,986 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:42:58,987 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:42:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:42:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:42:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2021-01-06 11:42:58,996 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2021-01-06 11:42:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:58,997 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2021-01-06 11:42:58,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2021-01-06 11:42:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:42:58,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:58,998 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:58,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:42:58,999 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2021-01-06 11:42:58,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:58,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477309737] [2021-01-06 11:42:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:59,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477309737] [2021-01-06 11:42:59,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:59,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:59,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605805637] [2021-01-06 11:42:59,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:59,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:59,066 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2021-01-06 11:42:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:59,525 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2021-01-06 11:42:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:59,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:42:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:59,528 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:42:59,528 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:42:59,529 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:42:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:42:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:42:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:42:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2021-01-06 11:42:59,539 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2021-01-06 11:42:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:59,540 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2021-01-06 11:42:59,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2021-01-06 11:42:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:42:59,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:59,541 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:42:59,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:42:59,542 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2021-01-06 11:42:59,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:59,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626962148] [2021-01-06 11:42:59,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:42:59,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626962148] [2021-01-06 11:42:59,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:59,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:59,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075010287] [2021-01-06 11:42:59,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:59,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:59,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:59,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:59,614 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2021-01-06 11:43:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:00,070 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2021-01-06 11:43:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:00,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:43:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:00,072 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:00,073 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:00,073 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:43:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2021-01-06 11:43:00,087 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2021-01-06 11:43:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:00,088 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2021-01-06 11:43:00,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2021-01-06 11:43:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:43:00,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:00,089 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:00,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:43:00,090 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2021-01-06 11:43:00,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:00,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402651219] [2021-01-06 11:43:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:00,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402651219] [2021-01-06 11:43:00,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:00,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:00,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675215372] [2021-01-06 11:43:00,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:00,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:00,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:00,163 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2021-01-06 11:43:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:00,615 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2021-01-06 11:43:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:00,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:43:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:00,618 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:43:00,618 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:43:00,619 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:43:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:43:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:43:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2021-01-06 11:43:00,628 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2021-01-06 11:43:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:00,628 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2021-01-06 11:43:00,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2021-01-06 11:43:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:43:00,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:00,629 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:00,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:43:00,630 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:00,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:00,630 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2021-01-06 11:43:00,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:00,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494140504] [2021-01-06 11:43:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:00,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494140504] [2021-01-06 11:43:00,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:00,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:00,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678270690] [2021-01-06 11:43:00,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:00,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:00,700 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2021-01-06 11:43:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:01,092 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2021-01-06 11:43:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:01,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:43:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:01,094 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:43:01,094 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:43:01,095 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:43:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:43:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:43:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2021-01-06 11:43:01,104 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2021-01-06 11:43:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:01,104 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2021-01-06 11:43:01,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2021-01-06 11:43:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:43:01,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:01,113 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:01,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:43:01,114 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2021-01-06 11:43:01,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:01,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769905179] [2021-01-06 11:43:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:01,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769905179] [2021-01-06 11:43:01,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:01,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:01,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035247082] [2021-01-06 11:43:01,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:01,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:01,182 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2021-01-06 11:43:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:01,666 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2021-01-06 11:43:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:01,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:43:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:01,669 INFO L225 Difference]: With dead ends: 524 [2021-01-06 11:43:01,670 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:43:01,670 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:43:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:43:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-01-06 11:43:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2021-01-06 11:43:01,680 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2021-01-06 11:43:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:01,680 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2021-01-06 11:43:01,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2021-01-06 11:43:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:43:01,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:01,682 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:01,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:43:01,682 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2021-01-06 11:43:01,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:01,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046460521] [2021-01-06 11:43:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:01,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046460521] [2021-01-06 11:43:01,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:01,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:01,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661026273] [2021-01-06 11:43:01,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:01,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:01,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:01,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:01,750 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2021-01-06 11:43:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,102 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2021-01-06 11:43:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:02,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:43:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,105 INFO L225 Difference]: With dead ends: 501 [2021-01-06 11:43:02,105 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:43:02,106 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:43:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:43:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2021-01-06 11:43:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2021-01-06 11:43:02,121 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2021-01-06 11:43:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,121 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2021-01-06 11:43:02,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2021-01-06 11:43:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:02,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,123 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:02,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:43:02,123 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2021-01-06 11:43:02,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482524569] [2021-01-06 11:43:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:43:02,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482524569] [2021-01-06 11:43:02,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:02,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:43:02,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109515461] [2021-01-06 11:43:02,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:43:02,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:43:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:43:02,210 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2021-01-06 11:43:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,683 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2021-01-06 11:43:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:43:02,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:43:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,685 INFO L225 Difference]: With dead ends: 524 [2021-01-06 11:43:02,685 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:43:02,686 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:43:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:43:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-01-06 11:43:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:43:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2021-01-06 11:43:02,696 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2021-01-06 11:43:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,696 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2021-01-06 11:43:02,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:43:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2021-01-06 11:43:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:02,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,698 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:02,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:43:02,698 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2021-01-06 11:43:02,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322646569] [2021-01-06 11:43:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:43:02,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322646569] [2021-01-06 11:43:02,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:02,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:02,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133568874] [2021-01-06 11:43:02,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:02,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:02,776 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2021-01-06 11:43:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:02,855 INFO L93 Difference]: Finished difference Result 719 states and 1071 transitions. [2021-01-06 11:43:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:02,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:02,858 INFO L225 Difference]: With dead ends: 719 [2021-01-06 11:43:02,858 INFO L226 Difference]: Without dead ends: 484 [2021-01-06 11:43:02,859 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:43:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-01-06 11:43:02,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2021-01-06 11:43:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2021-01-06 11:43:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 710 transitions. [2021-01-06 11:43:02,876 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 710 transitions. Word has length 96 [2021-01-06 11:43:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:02,876 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 710 transitions. [2021-01-06 11:43:02,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 710 transitions. [2021-01-06 11:43:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:02,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:02,878 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:02,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:43:02,878 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1537102738, now seen corresponding path program 1 times [2021-01-06 11:43:02,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:02,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519065232] [2021-01-06 11:43:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:43:02,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519065232] [2021-01-06 11:43:02,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:02,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:02,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145177191] [2021-01-06 11:43:02,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:02,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:02,936 INFO L87 Difference]: Start difference. First operand 484 states and 710 transitions. Second operand 3 states. [2021-01-06 11:43:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,017 INFO L93 Difference]: Finished difference Result 976 states and 1435 transitions. [2021-01-06 11:43:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:03,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,021 INFO L225 Difference]: With dead ends: 976 [2021-01-06 11:43:03,021 INFO L226 Difference]: Without dead ends: 511 [2021-01-06 11:43:03,022 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:43:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-06 11:43:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-01-06 11:43:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2021-01-06 11:43:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2021-01-06 11:43:03,044 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2021-01-06 11:43:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,045 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2021-01-06 11:43:03,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2021-01-06 11:43:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:43:03,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,047 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:03,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:43:03,048 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1564168340, now seen corresponding path program 1 times [2021-01-06 11:43:03,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821451045] [2021-01-06 11:43:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:43:03,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821451045] [2021-01-06 11:43:03,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:03,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054458687] [2021-01-06 11:43:03,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:03,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:03,108 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2021-01-06 11:43:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,146 INFO L93 Difference]: Finished difference Result 1005 states and 1471 transitions. [2021-01-06 11:43:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:03,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:43:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,150 INFO L225 Difference]: With dead ends: 1005 [2021-01-06 11:43:03,150 INFO L226 Difference]: Without dead ends: 513 [2021-01-06 11:43:03,153 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:43:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-01-06 11:43:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-01-06 11:43:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2021-01-06 11:43:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 747 transitions. [2021-01-06 11:43:03,178 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 747 transitions. Word has length 96 [2021-01-06 11:43:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,180 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 747 transitions. [2021-01-06 11:43:03,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 747 transitions. [2021-01-06 11:43:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:43:03,182 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,183 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:03,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:43:03,183 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2021-01-06 11:43:03,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718797619] [2021-01-06 11:43:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:03,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718797619] [2021-01-06 11:43:03,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:03,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111115744] [2021-01-06 11:43:03,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:03,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:03,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:03,265 INFO L87 Difference]: Start difference. First operand 513 states and 747 transitions. Second operand 3 states. [2021-01-06 11:43:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,335 INFO L93 Difference]: Finished difference Result 1240 states and 1821 transitions. [2021-01-06 11:43:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:03,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:43:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,340 INFO L225 Difference]: With dead ends: 1240 [2021-01-06 11:43:03,341 INFO L226 Difference]: Without dead ends: 748 [2021-01-06 11:43:03,342 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:43:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-01-06 11:43:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2021-01-06 11:43:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2021-01-06 11:43:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2021-01-06 11:43:03,371 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 98 [2021-01-06 11:43:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,372 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2021-01-06 11:43:03,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2021-01-06 11:43:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:43:03,374 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,374 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:43:03,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:43:03,374 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2021-01-06 11:43:03,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849961277] [2021-01-06 11:43:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:03,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849961277] [2021-01-06 11:43:03,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:03,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516741465] [2021-01-06 11:43:03,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:03,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:03,478 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 3 states. [2021-01-06 11:43:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,581 INFO L93 Difference]: Finished difference Result 1706 states and 2515 transitions. [2021-01-06 11:43:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:03,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:43:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,588 INFO L225 Difference]: With dead ends: 1706 [2021-01-06 11:43:03,589 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:43:03,591 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:43:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:43:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 979. [2021-01-06 11:43:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2021-01-06 11:43:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1429 transitions. [2021-01-06 11:43:03,629 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1429 transitions. Word has length 105 [2021-01-06 11:43:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,629 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 1429 transitions. [2021-01-06 11:43:03,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1429 transitions. [2021-01-06 11:43:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:43:03,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,632 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:43:03,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:43:03,633 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2021-01-06 11:43:03,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374277189] [2021-01-06 11:43:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:43:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:43:03,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374277189] [2021-01-06 11:43:03,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:43:03,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:43:03,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969062991] [2021-01-06 11:43:03,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:43:03,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:43:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:43:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:43:03,726 INFO L87 Difference]: Start difference. First operand 979 states and 1429 transitions. Second operand 3 states. [2021-01-06 11:43:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:43:03,802 INFO L93 Difference]: Finished difference Result 2170 states and 3182 transitions. [2021-01-06 11:43:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:43:03,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:43:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:43:03,810 INFO L225 Difference]: With dead ends: 2170 [2021-01-06 11:43:03,810 INFO L226 Difference]: Without dead ends: 1212 [2021-01-06 11:43:03,812 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:43:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-01-06 11:43:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2021-01-06 11:43:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2021-01-06 11:43:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1774 transitions. [2021-01-06 11:43:03,857 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1774 transitions. Word has length 122 [2021-01-06 11:43:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:43:03,858 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 1774 transitions. [2021-01-06 11:43:03,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:43:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1774 transitions. [2021-01-06 11:43:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 11:43:03,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:43:03,861 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2021-01-06 11:43:03,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:43:03,861 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:43:03,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:43:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2021-01-06 11:43:03,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:43:03,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642322570] [2021-01-06 11:43:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:43:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:43:04,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:43:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:43:04,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:43:04,400 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:43:04,401 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:43:04,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:43:04,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:43:04 BoogieIcfgContainer [2021-01-06 11:43:04,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:43:04,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:43:04,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:43:04,609 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:43:04,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:42:41" (3/4) ... [2021-01-06 11:43:04,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:43:04,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:43:04,616 INFO L168 Benchmark]: Toolchain (without parser) took 25806.78 ms. Allocated memory was 151.0 MB in the beginning and 287.3 MB in the end (delta: 136.3 MB). Free memory was 124.5 MB in the beginning and 127.3 MB in the end (delta: -2.8 MB). Peak memory consumption was 134.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,617 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 131.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:43:04,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.80 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 127.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.89 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 123.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,618 INFO L168 Benchmark]: Boogie Preprocessor took 163.64 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 116.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,619 INFO L168 Benchmark]: RCFGBuilder took 1397.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 98.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,619 INFO L168 Benchmark]: TraceAbstraction took 23317.60 ms. Allocated memory was 151.0 MB in the beginning and 287.3 MB in the end (delta: 136.3 MB). Free memory was 98.2 MB in the beginning and 127.8 MB in the end (delta: -29.5 MB). Peak memory consumption was 107.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:43:04,619 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 287.3 MB. Free memory was 127.8 MB in the beginning and 127.3 MB in the end (delta: 507.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:43:04,621 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 131.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 809.80 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 127.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 101.89 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 123.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 163.64 ms. Allocated memory is still 151.0 MB. Free memory was 123.5 MB in the beginning and 116.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1397.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 98.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23317.60 ms. Allocated memory was 151.0 MB in the beginning and 287.3 MB in the end (delta: 136.3 MB). Free memory was 98.2 MB in the beginning and 127.8 MB in the end (delta: -29.5 MB). Peak memory consumption was 107.3 MB. Max. memory is 8.0 GB. * Witness Printer took 5.10 ms. Allocated memory is still 287.3 MB. Free memory was 127.8 MB in the beginning and 127.3 MB in the end (delta: 507.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1728]: 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 1446. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND FALSE !(s->hit) [L1357] s->state = 8512 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND TRUE s->state == 8512 [L1363] EXPR s->s3 [L1363] EXPR (s->s3)->tmp.new_cipher [L1363] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1363] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1366] ret = __VERIFIER_nondet_int() [L1367] COND TRUE blastFlag == 2 [L1368] blastFlag = 6 VAL [init=1, SSLv3_server_data={6:0}] [L1372] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1378] s->state = 8528 [L1379] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND TRUE s->state == 8528 [L1383] EXPR s->s3 [L1383] EXPR (s->s3)->tmp.new_cipher [L1383] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1383] l = ((s->s3)->tmp.new_cipher)->algorithms [L1384] EXPR s->options VAL [init=1, SSLv3_server_data={6:0}] [L1384] COND TRUE s->options & 2097152UL [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 1 [L1389] EXPR s->s3 [L1389] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={6:0}] [L1389] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1407] ret = __VERIFIER_nondet_int() [L1408] COND TRUE blastFlag == 6 [L1409] blastFlag = 7 VAL [init=1, SSLv3_server_data={6:0}] [L1413] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1430] s->state = 8544 [L1431] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND TRUE s->state == 8544 [L1435] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={6:0}] [L1435] COND TRUE s->verify_mode & 1 [L1436] EXPR s->session [L1436] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={6:0}] [L1436] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1446] EXPR s->s3 [L1446] EXPR (s->s3)->tmp.new_cipher [L1446] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1446] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1456] EXPR s->s3 [L1456] (s->s3)->tmp.cert_request = 1 [L1457] ret = __VERIFIER_nondet_int() [L1458] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={6:0}] [L1728] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.0s, OverallIterations: 47, TraceHistogramMax: 5, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9301 SDtfs, 2847 SDslu, 13200 SDs, 0 SdLazy, 7617 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 92 SyntacticMatches, 32 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 46 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3665 NumberOfCodeBlocks, 3665 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3492 ConstructedInterpolants, 0 QuantifiedInterpolants, 799416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 2126/2126 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...