/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:38:21,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:38:21,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:38:21,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:38:21,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:38:21,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:38:21,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:38:21,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:38:21,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:38:21,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:38:21,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:38:21,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:38:21,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:38:21,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:38:21,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:38:21,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:38:21,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:38:21,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:38:21,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:38:21,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:38:21,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:38:21,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:38:21,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:38:21,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:38:21,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:38:21,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:38:21,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:38:21,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:38:21,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:38:21,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:38:21,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:38:21,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:38:21,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:38:21,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:38:21,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:38:21,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:38:21,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:38:21,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:38:21,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:38:21,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:38:21,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:38:21,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:38:22,025 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:38:22,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:38:22,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:38:22,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:38:22,030 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:38:22,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:38:22,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:38:22,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:38:22,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:38:22,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:38:22,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:38:22,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:38:22,032 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:38:22,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:38:22,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:38:22,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:38:22,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:38:22,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:38:22,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:38:22,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:38:22,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:38:22,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:38:22,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:38:22,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:38:22,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:38:22,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:38:22,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:38:22,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:38:22,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:38:22,502 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:38:22,503 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:38:22,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-01-06 11:38:22,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4b524e518/7a365480f9d6475ca02c102eab638ec3/FLAGab5e9dd68 [2021-01-06 11:38:23,263 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:38:23,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-01-06 11:38:23,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4b524e518/7a365480f9d6475ca02c102eab638ec3/FLAGab5e9dd68 [2021-01-06 11:38:23,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4b524e518/7a365480f9d6475ca02c102eab638ec3 [2021-01-06 11:38:23,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:38:23,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:38:23,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:23,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:38:23,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:38:23,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:23" (1/1) ... [2021-01-06 11:38:23,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cf11a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:23, skipping insertion in model container [2021-01-06 11:38:23,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:38:23" (1/1) ... [2021-01-06 11:38:23,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:38:23,586 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_client_data~0,GLOBAL],ssl_connect] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_client_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem95,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem97,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem97,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem102,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem103,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem103,],offset]]]] 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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem118,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem118,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:38:24,053 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:24,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:24,130 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_client_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],StructAccessExpression[IdentifierExpression[~s~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem93,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem93,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem95,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[618],StructAccessExpression[IdentifierExpression[#t~mem95,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem97,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem97,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem102,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem102,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem103,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[188],StructAccessExpression[IdentifierExpression[#t~mem103,],offset]]]] 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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem118,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem118,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem119,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem119,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2021-01-06 11:38:24,296 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:38:24,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:38:24,343 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:38:24,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24 WrapperNode [2021-01-06 11:38:24,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:38:24,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:24,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:38:24,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:38:24,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:38:24,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:38:24,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:38:24,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:38:24,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... [2021-01-06 11:38:24,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:38:24,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:38:24,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:38:24,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:38:24,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:38:24,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:38:24,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:38:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:38:24,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:38:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:38:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:38:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:38:24,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:38:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:38:24,904 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:38:25,847 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-01-06 11:38:25,848 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-01-06 11:38:25,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:38:25,859 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:38:25,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:25 BoogieIcfgContainer [2021-01-06 11:38:25,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:38:25,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:38:25,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:38:25,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:38:25,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:38:23" (1/3) ... [2021-01-06 11:38:25,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:25, skipping insertion in model container [2021-01-06 11:38:25,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:38:24" (2/3) ... [2021-01-06 11:38:25,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:38:25, skipping insertion in model container [2021-01-06 11:38:25,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:25" (3/3) ... [2021-01-06 11:38:25,870 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2021-01-06 11:38:25,876 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:38:25,882 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:38:25,901 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:38:25,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:38:25,928 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:38:25,929 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:38:25,929 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:38:25,929 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:38:25,929 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:38:25,929 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:38:25,929 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:38:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-01-06 11:38:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:38:25,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:25,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:25,956 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-01-06 11:38:25,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:25,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439289005] [2021-01-06 11:38:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:38:26,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439289005] [2021-01-06 11:38:26,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:26,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:26,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75715587] [2021-01-06 11:38:26,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:26,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:26,391 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2021-01-06 11:38:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:26,950 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2021-01-06 11:38:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:26,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-06 11:38:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:26,964 INFO L225 Difference]: With dead ends: 259 [2021-01-06 11:38:26,964 INFO L226 Difference]: Without dead ends: 118 [2021-01-06 11:38:26,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-01-06 11:38:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2021-01-06 11:38:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2021-01-06 11:38:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2021-01-06 11:38:27,015 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2021-01-06 11:38:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:27,016 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2021-01-06 11:38:27,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2021-01-06 11:38:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:38:27,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:27,018 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] [2021-01-06 11:38:27,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:38:27,019 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:27,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:27,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2021-01-06 11:38:27,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:27,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584510405] [2021-01-06 11:38:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:27,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584510405] [2021-01-06 11:38:27,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:27,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:27,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771390718] [2021-01-06 11:38:27,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:27,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:27,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:27,193 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2021-01-06 11:38:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:27,254 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2021-01-06 11:38:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:27,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 11:38:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:27,259 INFO L225 Difference]: With dead ends: 327 [2021-01-06 11:38:27,259 INFO L226 Difference]: Without dead ends: 220 [2021-01-06 11:38:27,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-01-06 11:38:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-01-06 11:38:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2021-01-06 11:38:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2021-01-06 11:38:27,285 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2021-01-06 11:38:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:27,286 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2021-01-06 11:38:27,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2021-01-06 11:38:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 11:38:27,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:27,289 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:27,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:38:27,290 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2021-01-06 11:38:27,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:27,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909907793] [2021-01-06 11:38:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 11:38:27,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909907793] [2021-01-06 11:38:27,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:27,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:27,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548708528] [2021-01-06 11:38:27,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:27,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:27,455 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2021-01-06 11:38:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:27,581 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2021-01-06 11:38:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:27,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-06 11:38:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:27,586 INFO L225 Difference]: With dead ends: 429 [2021-01-06 11:38:27,586 INFO L226 Difference]: Without dead ends: 322 [2021-01-06 11:38:27,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-01-06 11:38:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2021-01-06 11:38:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2021-01-06 11:38:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2021-01-06 11:38:27,613 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2021-01-06 11:38:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:27,613 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2021-01-06 11:38:27,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2021-01-06 11:38:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:38:27,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:27,618 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:27,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:38:27,618 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:27,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2021-01-06 11:38:27,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:27,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322769717] [2021-01-06 11:38:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:27,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322769717] [2021-01-06 11:38:27,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:27,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:27,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960146729] [2021-01-06 11:38:27,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:27,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:27,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:27,740 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2021-01-06 11:38:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:28,463 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2021-01-06 11:38:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:28,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 11:38:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:28,468 INFO L225 Difference]: With dead ends: 822 [2021-01-06 11:38:28,468 INFO L226 Difference]: Without dead ends: 510 [2021-01-06 11:38:28,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-01-06 11:38:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2021-01-06 11:38:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2021-01-06 11:38:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2021-01-06 11:38:28,494 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2021-01-06 11:38:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:28,494 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2021-01-06 11:38:28,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2021-01-06 11:38:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:38:28,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:28,499 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:28,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:38:28,499 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2021-01-06 11:38:28,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:28,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116865190] [2021-01-06 11:38:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:28,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116865190] [2021-01-06 11:38:28,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:28,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:28,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493310739] [2021-01-06 11:38:28,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:28,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:28,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:28,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:28,625 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2021-01-06 11:38:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:29,176 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2021-01-06 11:38:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:29,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 11:38:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:29,180 INFO L225 Difference]: With dead ends: 818 [2021-01-06 11:38:29,180 INFO L226 Difference]: Without dead ends: 456 [2021-01-06 11:38:29,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-01-06 11:38:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2021-01-06 11:38:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2021-01-06 11:38:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2021-01-06 11:38:29,199 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2021-01-06 11:38:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:29,200 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2021-01-06 11:38:29,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2021-01-06 11:38:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:38:29,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:29,204 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:29,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:38:29,204 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2021-01-06 11:38:29,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:29,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192078411] [2021-01-06 11:38:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:29,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192078411] [2021-01-06 11:38:29,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:29,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:29,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162281] [2021-01-06 11:38:29,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:29,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:29,381 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2021-01-06 11:38:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:30,015 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2021-01-06 11:38:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:30,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 11:38:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:30,022 INFO L225 Difference]: With dead ends: 946 [2021-01-06 11:38:30,022 INFO L226 Difference]: Without dead ends: 544 [2021-01-06 11:38:30,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-01-06 11:38:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2021-01-06 11:38:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2021-01-06 11:38:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2021-01-06 11:38:30,042 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2021-01-06 11:38:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:30,044 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2021-01-06 11:38:30,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2021-01-06 11:38:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:38:30,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:30,051 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:30,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:38:30,057 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2021-01-06 11:38:30,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:30,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761630799] [2021-01-06 11:38:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:30,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761630799] [2021-01-06 11:38:30,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:30,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:30,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589318405] [2021-01-06 11:38:30,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:30,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:30,209 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2021-01-06 11:38:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:30,879 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2021-01-06 11:38:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:30,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:38:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:30,884 INFO L225 Difference]: With dead ends: 948 [2021-01-06 11:38:30,884 INFO L226 Difference]: Without dead ends: 544 [2021-01-06 11:38:30,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-01-06 11:38:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2021-01-06 11:38:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2021-01-06 11:38:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2021-01-06 11:38:30,901 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2021-01-06 11:38:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:30,901 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2021-01-06 11:38:30,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2021-01-06 11:38:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:38:30,903 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:30,903 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:30,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:38:30,904 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2021-01-06 11:38:30,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:30,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307827209] [2021-01-06 11:38:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:30,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307827209] [2021-01-06 11:38:30,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:30,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:30,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471172492] [2021-01-06 11:38:30,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:30,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:31,000 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2021-01-06 11:38:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:31,720 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2021-01-06 11:38:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:31,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:38:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:31,724 INFO L225 Difference]: With dead ends: 940 [2021-01-06 11:38:31,724 INFO L226 Difference]: Without dead ends: 534 [2021-01-06 11:38:31,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-01-06 11:38:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2021-01-06 11:38:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2021-01-06 11:38:31,741 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2021-01-06 11:38:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:31,741 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2021-01-06 11:38:31,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2021-01-06 11:38:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:31,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:31,743 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:31,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:38:31,744 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2021-01-06 11:38:31,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:31,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242934948] [2021-01-06 11:38:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:31,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242934948] [2021-01-06 11:38:31,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:31,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:31,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396680263] [2021-01-06 11:38:31,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:31,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:31,833 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2021-01-06 11:38:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:32,531 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2021-01-06 11:38:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:32,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:32,535 INFO L225 Difference]: With dead ends: 940 [2021-01-06 11:38:32,535 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:32,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-01-06 11:38:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2021-01-06 11:38:32,551 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2021-01-06 11:38:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:32,551 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2021-01-06 11:38:32,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2021-01-06 11:38:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:32,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:32,553 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2021-01-06 11:38:32,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:38:32,554 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2021-01-06 11:38:32,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:32,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862809382] [2021-01-06 11:38:32,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:32,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862809382] [2021-01-06 11:38:32,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:32,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:32,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672300297] [2021-01-06 11:38:32,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:32,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:32,637 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2021-01-06 11:38:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:33,229 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2021-01-06 11:38:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:33,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:33,233 INFO L225 Difference]: With dead ends: 940 [2021-01-06 11:38:33,233 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:33,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-01-06 11:38:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2021-01-06 11:38:33,251 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2021-01-06 11:38:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:33,251 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2021-01-06 11:38:33,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2021-01-06 11:38:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:33,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:33,253 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:33,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:38:33,253 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2021-01-06 11:38:33,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:33,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909111720] [2021-01-06 11:38:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:33,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909111720] [2021-01-06 11:38:33,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:33,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:33,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706800542] [2021-01-06 11:38:33,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:33,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:33,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:33,363 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2021-01-06 11:38:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:33,968 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2021-01-06 11:38:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:33,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:33,972 INFO L225 Difference]: With dead ends: 791 [2021-01-06 11:38:33,972 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:33,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-01-06 11:38:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2021-01-06 11:38:33,987 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2021-01-06 11:38:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:33,988 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2021-01-06 11:38:33,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2021-01-06 11:38:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:33,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:33,990 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:33,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:38:33,990 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2021-01-06 11:38:33,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:33,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835350528] [2021-01-06 11:38:33,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:34,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835350528] [2021-01-06 11:38:34,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:34,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:34,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216455018] [2021-01-06 11:38:34,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:34,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:34,073 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2021-01-06 11:38:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:34,543 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2021-01-06 11:38:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:34,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:34,547 INFO L225 Difference]: With dead ends: 868 [2021-01-06 11:38:34,547 INFO L226 Difference]: Without dead ends: 460 [2021-01-06 11:38:34,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-01-06 11:38:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-01-06 11:38:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2021-01-06 11:38:34,563 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2021-01-06 11:38:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:34,564 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2021-01-06 11:38:34,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2021-01-06 11:38:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:34,565 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:34,566 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2021-01-06 11:38:34,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:38:34,566 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2021-01-06 11:38:34,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:34,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813659167] [2021-01-06 11:38:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:34,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813659167] [2021-01-06 11:38:34,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:34,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:34,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375318185] [2021-01-06 11:38:34,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:34,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:34,669 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2021-01-06 11:38:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:35,149 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2021-01-06 11:38:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:35,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:35,153 INFO L225 Difference]: With dead ends: 868 [2021-01-06 11:38:35,153 INFO L226 Difference]: Without dead ends: 460 [2021-01-06 11:38:35,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-01-06 11:38:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-01-06 11:38:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2021-01-06 11:38:35,169 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2021-01-06 11:38:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:35,169 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2021-01-06 11:38:35,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2021-01-06 11:38:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:38:35,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:35,172 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:35,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:38:35,172 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2021-01-06 11:38:35,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:35,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707433026] [2021-01-06 11:38:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:35,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707433026] [2021-01-06 11:38:35,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:35,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:35,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675303410] [2021-01-06 11:38:35,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:35,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:35,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:35,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:35,256 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2021-01-06 11:38:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:35,694 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2021-01-06 11:38:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:35,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:38:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:35,698 INFO L225 Difference]: With dead ends: 719 [2021-01-06 11:38:35,698 INFO L226 Difference]: Without dead ends: 460 [2021-01-06 11:38:35,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-01-06 11:38:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-01-06 11:38:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2021-01-06 11:38:35,712 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2021-01-06 11:38:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:35,713 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2021-01-06 11:38:35,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2021-01-06 11:38:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:35,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:35,715 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:35,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:38:35,715 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2021-01-06 11:38:35,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:35,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920400956] [2021-01-06 11:38:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:35,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920400956] [2021-01-06 11:38:35,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:35,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:35,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757594050] [2021-01-06 11:38:35,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:35,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:35,791 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2021-01-06 11:38:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:36,584 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2021-01-06 11:38:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:36,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:36,588 INFO L225 Difference]: With dead ends: 940 [2021-01-06 11:38:36,589 INFO L226 Difference]: Without dead ends: 532 [2021-01-06 11:38:36,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-01-06 11:38:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-01-06 11:38:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2021-01-06 11:38:36,605 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2021-01-06 11:38:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:36,606 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2021-01-06 11:38:36,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2021-01-06 11:38:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:36,607 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:36,608 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:36,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:38:36,608 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2021-01-06 11:38:36,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:36,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80333067] [2021-01-06 11:38:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:36,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80333067] [2021-01-06 11:38:36,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:36,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:36,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885552206] [2021-01-06 11:38:36,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:36,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:36,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:36,692 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2021-01-06 11:38:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:37,326 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2021-01-06 11:38:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:37,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:37,330 INFO L225 Difference]: With dead ends: 785 [2021-01-06 11:38:37,330 INFO L226 Difference]: Without dead ends: 526 [2021-01-06 11:38:37,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-01-06 11:38:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2021-01-06 11:38:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2021-01-06 11:38:37,345 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2021-01-06 11:38:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:37,346 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2021-01-06 11:38:37,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2021-01-06 11:38:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:37,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:37,348 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:37,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:38:37,348 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:37,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:37,349 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2021-01-06 11:38:37,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:37,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106771524] [2021-01-06 11:38:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:37,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106771524] [2021-01-06 11:38:37,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:37,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:37,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927594222] [2021-01-06 11:38:37,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:37,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:37,425 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2021-01-06 11:38:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:37,888 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2021-01-06 11:38:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:37,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:37,893 INFO L225 Difference]: With dead ends: 868 [2021-01-06 11:38:37,893 INFO L226 Difference]: Without dead ends: 460 [2021-01-06 11:38:37,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-01-06 11:38:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-01-06 11:38:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2021-01-06 11:38:37,914 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2021-01-06 11:38:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:37,914 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2021-01-06 11:38:37,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2021-01-06 11:38:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:38:37,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:37,916 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:37,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:38:37,917 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2021-01-06 11:38:37,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:37,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684463728] [2021-01-06 11:38:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:38,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684463728] [2021-01-06 11:38:38,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:38,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:38,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697607711] [2021-01-06 11:38:38,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:38,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:38,017 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2021-01-06 11:38:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:38,512 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2021-01-06 11:38:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:38,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:38:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:38,516 INFO L225 Difference]: With dead ends: 713 [2021-01-06 11:38:38,516 INFO L226 Difference]: Without dead ends: 454 [2021-01-06 11:38:38,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-01-06 11:38:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2021-01-06 11:38:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2021-01-06 11:38:38,532 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2021-01-06 11:38:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:38,532 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2021-01-06 11:38:38,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2021-01-06 11:38:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:38:38,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:38,534 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:38,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:38:38,535 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2021-01-06 11:38:38,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:38,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717044365] [2021-01-06 11:38:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:38,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717044365] [2021-01-06 11:38:38,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:38,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:38,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390851693] [2021-01-06 11:38:38,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:38,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:38,608 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2021-01-06 11:38:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:39,162 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2021-01-06 11:38:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:39,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:38:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:39,169 INFO L225 Difference]: With dead ends: 934 [2021-01-06 11:38:39,169 INFO L226 Difference]: Without dead ends: 526 [2021-01-06 11:38:39,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-01-06 11:38:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2021-01-06 11:38:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2021-01-06 11:38:39,184 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2021-01-06 11:38:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:39,184 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2021-01-06 11:38:39,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2021-01-06 11:38:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:38:39,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:39,186 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:39,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:38:39,187 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2021-01-06 11:38:39,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:39,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849711366] [2021-01-06 11:38:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:39,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849711366] [2021-01-06 11:38:39,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:39,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:39,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636894702] [2021-01-06 11:38:39,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:39,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:39,278 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2021-01-06 11:38:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:39,768 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2021-01-06 11:38:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:39,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:38:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:39,771 INFO L225 Difference]: With dead ends: 862 [2021-01-06 11:38:39,771 INFO L226 Difference]: Without dead ends: 454 [2021-01-06 11:38:39,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-01-06 11:38:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2021-01-06 11:38:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2021-01-06 11:38:39,786 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2021-01-06 11:38:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:39,786 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2021-01-06 11:38:39,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2021-01-06 11:38:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:38:39,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:39,788 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:39,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:38:39,788 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2021-01-06 11:38:39,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:39,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105227138] [2021-01-06 11:38:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:39,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105227138] [2021-01-06 11:38:39,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:39,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:39,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481150664] [2021-01-06 11:38:39,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:39,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:39,862 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2021-01-06 11:38:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:40,483 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2021-01-06 11:38:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:40,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:38:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:40,486 INFO L225 Difference]: With dead ends: 916 [2021-01-06 11:38:40,486 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 11:38:40,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 11:38:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2021-01-06 11:38:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2021-01-06 11:38:40,501 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2021-01-06 11:38:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:40,501 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2021-01-06 11:38:40,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2021-01-06 11:38:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:38:40,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:40,503 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:40,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:38:40,503 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2021-01-06 11:38:40,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:40,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412594410] [2021-01-06 11:38:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:40,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412594410] [2021-01-06 11:38:40,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:40,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:40,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118290351] [2021-01-06 11:38:40,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:40,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:40,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:40,585 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2021-01-06 11:38:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:41,085 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2021-01-06 11:38:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:41,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:38:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:41,089 INFO L225 Difference]: With dead ends: 916 [2021-01-06 11:38:41,089 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 11:38:41,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 11:38:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2021-01-06 11:38:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2021-01-06 11:38:41,103 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2021-01-06 11:38:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:41,103 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2021-01-06 11:38:41,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2021-01-06 11:38:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:38:41,105 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:41,105 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:38:41,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:38:41,106 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2021-01-06 11:38:41,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:41,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366368368] [2021-01-06 11:38:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 11:38:41,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366368368] [2021-01-06 11:38:41,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:41,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:41,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441099667] [2021-01-06 11:38:41,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:41,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:41,178 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2021-01-06 11:38:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:41,568 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2021-01-06 11:38:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:41,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:38:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:41,571 INFO L225 Difference]: With dead ends: 844 [2021-01-06 11:38:41,571 INFO L226 Difference]: Without dead ends: 436 [2021-01-06 11:38:41,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-01-06 11:38:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2021-01-06 11:38:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 11:38:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2021-01-06 11:38:41,586 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2021-01-06 11:38:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:41,586 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2021-01-06 11:38:41,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2021-01-06 11:38:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:38:41,588 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:41,588 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:41,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:38:41,589 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2021-01-06 11:38:41,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:41,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186662531] [2021-01-06 11:38:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 11:38:41,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186662531] [2021-01-06 11:38:41,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:41,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:41,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547058226] [2021-01-06 11:38:41,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:41,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:41,666 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2021-01-06 11:38:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:41,784 INFO L93 Difference]: Finished difference Result 827 states and 1200 transitions. [2021-01-06 11:38:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:41,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 11:38:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:41,788 INFO L225 Difference]: With dead ends: 827 [2021-01-06 11:38:41,788 INFO L226 Difference]: Without dead ends: 570 [2021-01-06 11:38:41,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-01-06 11:38:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-01-06 11:38:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2021-01-06 11:38:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 820 transitions. [2021-01-06 11:38:41,806 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 820 transitions. Word has length 90 [2021-01-06 11:38:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:41,806 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 820 transitions. [2021-01-06 11:38:41,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 820 transitions. [2021-01-06 11:38:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:38:41,808 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:41,808 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:41,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:38:41,809 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2021-01-06 11:38:41,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:41,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98228331] [2021-01-06 11:38:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-06 11:38:41,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98228331] [2021-01-06 11:38:41,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:41,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:41,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418190629] [2021-01-06 11:38:41,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:41,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:41,879 INFO L87 Difference]: Start difference. First operand 570 states and 820 transitions. Second operand 3 states. [2021-01-06 11:38:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:41,919 INFO L93 Difference]: Finished difference Result 725 states and 1045 transitions. [2021-01-06 11:38:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:41,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 11:38:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:41,923 INFO L225 Difference]: With dead ends: 725 [2021-01-06 11:38:41,923 INFO L226 Difference]: Without dead ends: 723 [2021-01-06 11:38:41,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-01-06 11:38:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-01-06 11:38:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2021-01-06 11:38:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1042 transitions. [2021-01-06 11:38:41,944 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1042 transitions. Word has length 92 [2021-01-06 11:38:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:41,945 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1042 transitions. [2021-01-06 11:38:41,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1042 transitions. [2021-01-06 11:38:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 11:38:41,947 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:41,947 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:41,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:38:41,947 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2021-01-06 11:38:41,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:41,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969973713] [2021-01-06 11:38:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:42,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969973713] [2021-01-06 11:38:42,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:42,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:42,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286040622] [2021-01-06 11:38:42,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:42,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:42,025 INFO L87 Difference]: Start difference. First operand 723 states and 1042 transitions. Second operand 3 states. [2021-01-06 11:38:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:42,053 INFO L93 Difference]: Finished difference Result 725 states and 1043 transitions. [2021-01-06 11:38:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:42,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2021-01-06 11:38:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:42,057 INFO L225 Difference]: With dead ends: 725 [2021-01-06 11:38:42,057 INFO L226 Difference]: Without dead ends: 723 [2021-01-06 11:38:42,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-01-06 11:38:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-01-06 11:38:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2021-01-06 11:38:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1041 transitions. [2021-01-06 11:38:42,093 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1041 transitions. Word has length 113 [2021-01-06 11:38:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:42,093 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1041 transitions. [2021-01-06 11:38:42,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1041 transitions. [2021-01-06 11:38:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 11:38:42,096 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:42,096 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:42,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:38:42,096 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2021-01-06 11:38:42,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:42,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475417829] [2021-01-06 11:38:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:42,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475417829] [2021-01-06 11:38:42,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:42,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:42,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847282058] [2021-01-06 11:38:42,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:42,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:42,219 INFO L87 Difference]: Start difference. First operand 723 states and 1041 transitions. Second operand 4 states. [2021-01-06 11:38:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:42,704 INFO L93 Difference]: Finished difference Result 1692 states and 2446 transitions. [2021-01-06 11:38:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:42,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2021-01-06 11:38:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:42,711 INFO L225 Difference]: With dead ends: 1692 [2021-01-06 11:38:42,711 INFO L226 Difference]: Without dead ends: 979 [2021-01-06 11:38:42,712 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:38:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-01-06 11:38:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-01-06 11:38:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2021-01-06 11:38:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1251 transitions. [2021-01-06 11:38:42,739 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1251 transitions. Word has length 115 [2021-01-06 11:38:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:42,739 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1251 transitions. [2021-01-06 11:38:42,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1251 transitions. [2021-01-06 11:38:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 11:38:42,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:42,742 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2021-01-06 11:38:42,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:38:42,743 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2021-01-06 11:38:42,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:42,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064186853] [2021-01-06 11:38:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:42,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064186853] [2021-01-06 11:38:42,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:42,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:42,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133133059] [2021-01-06 11:38:42,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:42,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:42,833 INFO L87 Difference]: Start difference. First operand 843 states and 1251 transitions. Second operand 4 states. [2021-01-06 11:38:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:43,301 INFO L93 Difference]: Finished difference Result 1807 states and 2646 transitions. [2021-01-06 11:38:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:43,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2021-01-06 11:38:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:43,307 INFO L225 Difference]: With dead ends: 1807 [2021-01-06 11:38:43,307 INFO L226 Difference]: Without dead ends: 974 [2021-01-06 11:38:43,309 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:38:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-01-06 11:38:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-01-06 11:38:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2021-01-06 11:38:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1246 transitions. [2021-01-06 11:38:43,336 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1246 transitions. Word has length 130 [2021-01-06 11:38:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:43,337 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1246 transitions. [2021-01-06 11:38:43,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1246 transitions. [2021-01-06 11:38:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 11:38:43,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:43,340 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:43,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:38:43,340 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2021-01-06 11:38:43,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:43,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003039624] [2021-01-06 11:38:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:43,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003039624] [2021-01-06 11:38:43,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:43,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:43,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013217365] [2021-01-06 11:38:43,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:43,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:43,433 INFO L87 Difference]: Start difference. First operand 843 states and 1246 transitions. Second operand 4 states. [2021-01-06 11:38:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:43,961 INFO L93 Difference]: Finished difference Result 1807 states and 2636 transitions. [2021-01-06 11:38:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:43,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2021-01-06 11:38:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:43,967 INFO L225 Difference]: With dead ends: 1807 [2021-01-06 11:38:43,967 INFO L226 Difference]: Without dead ends: 974 [2021-01-06 11:38:43,969 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:38:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-01-06 11:38:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-01-06 11:38:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2021-01-06 11:38:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1241 transitions. [2021-01-06 11:38:43,996 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1241 transitions. Word has length 130 [2021-01-06 11:38:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:43,996 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1241 transitions. [2021-01-06 11:38:43,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1241 transitions. [2021-01-06 11:38:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 11:38:43,999 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:43,999 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:44,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:38:44,000 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2021-01-06 11:38:44,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:44,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240275004] [2021-01-06 11:38:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-01-06 11:38:44,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240275004] [2021-01-06 11:38:44,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:44,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:44,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707474134] [2021-01-06 11:38:44,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:44,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:44,117 INFO L87 Difference]: Start difference. First operand 843 states and 1241 transitions. Second operand 4 states. [2021-01-06 11:38:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:44,569 INFO L93 Difference]: Finished difference Result 1639 states and 2418 transitions. [2021-01-06 11:38:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:44,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2021-01-06 11:38:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:44,575 INFO L225 Difference]: With dead ends: 1639 [2021-01-06 11:38:44,575 INFO L226 Difference]: Without dead ends: 981 [2021-01-06 11:38:44,577 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:38:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-01-06 11:38:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-01-06 11:38:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2021-01-06 11:38:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1361 transitions. [2021-01-06 11:38:44,601 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1361 transitions. Word has length 130 [2021-01-06 11:38:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:44,602 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1361 transitions. [2021-01-06 11:38:44,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1361 transitions. [2021-01-06 11:38:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 11:38:44,605 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:44,605 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:44,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:38:44,605 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:44,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2021-01-06 11:38:44,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:44,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968571239] [2021-01-06 11:38:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:44,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968571239] [2021-01-06 11:38:44,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:44,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:44,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36558119] [2021-01-06 11:38:44,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:44,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:44,693 INFO L87 Difference]: Start difference. First operand 915 states and 1361 transitions. Second operand 4 states. [2021-01-06 11:38:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:45,147 INFO L93 Difference]: Finished difference Result 1951 states and 2866 transitions. [2021-01-06 11:38:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:45,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 11:38:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:45,154 INFO L225 Difference]: With dead ends: 1951 [2021-01-06 11:38:45,154 INFO L226 Difference]: Without dead ends: 1046 [2021-01-06 11:38:45,156 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:38:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-01-06 11:38:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-01-06 11:38:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2021-01-06 11:38:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1356 transitions. [2021-01-06 11:38:45,186 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1356 transitions. Word has length 131 [2021-01-06 11:38:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:45,187 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1356 transitions. [2021-01-06 11:38:45,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1356 transitions. [2021-01-06 11:38:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-01-06 11:38:45,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:45,190 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:45,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:38:45,191 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2021-01-06 11:38:45,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:45,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006253462] [2021-01-06 11:38:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:45,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006253462] [2021-01-06 11:38:45,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:45,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:45,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429117210] [2021-01-06 11:38:45,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:45,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:45,293 INFO L87 Difference]: Start difference. First operand 915 states and 1356 transitions. Second operand 4 states. [2021-01-06 11:38:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:45,728 INFO L93 Difference]: Finished difference Result 1951 states and 2856 transitions. [2021-01-06 11:38:45,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:45,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2021-01-06 11:38:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:45,735 INFO L225 Difference]: With dead ends: 1951 [2021-01-06 11:38:45,735 INFO L226 Difference]: Without dead ends: 1046 [2021-01-06 11:38:45,737 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:38:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-01-06 11:38:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-01-06 11:38:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2021-01-06 11:38:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1351 transitions. [2021-01-06 11:38:45,764 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1351 transitions. Word has length 132 [2021-01-06 11:38:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:45,764 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1351 transitions. [2021-01-06 11:38:45,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1351 transitions. [2021-01-06 11:38:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 11:38:45,768 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:45,768 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:45,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:38:45,769 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2021-01-06 11:38:45,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:45,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427465937] [2021-01-06 11:38:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:38:45,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427465937] [2021-01-06 11:38:45,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:45,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:45,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536747831] [2021-01-06 11:38:45,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:45,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:45,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:45,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:45,858 INFO L87 Difference]: Start difference. First operand 915 states and 1351 transitions. Second operand 4 states. [2021-01-06 11:38:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:46,377 INFO L93 Difference]: Finished difference Result 1906 states and 2791 transitions. [2021-01-06 11:38:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:46,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 11:38:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:46,385 INFO L225 Difference]: With dead ends: 1906 [2021-01-06 11:38:46,386 INFO L226 Difference]: Without dead ends: 1001 [2021-01-06 11:38:46,387 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:38:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-01-06 11:38:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 915. [2021-01-06 11:38:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2021-01-06 11:38:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1346 transitions. [2021-01-06 11:38:46,413 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1346 transitions. Word has length 133 [2021-01-06 11:38:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:46,413 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1346 transitions. [2021-01-06 11:38:46,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1346 transitions. [2021-01-06 11:38:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 11:38:46,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:46,417 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:46,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:38:46,417 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2021-01-06 11:38:46,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:46,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566899442] [2021-01-06 11:38:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-01-06 11:38:46,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566899442] [2021-01-06 11:38:46,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:46,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:46,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034348547] [2021-01-06 11:38:46,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:46,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:46,509 INFO L87 Difference]: Start difference. First operand 915 states and 1346 transitions. Second operand 4 states. [2021-01-06 11:38:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:47,015 INFO L93 Difference]: Finished difference Result 2051 states and 3021 transitions. [2021-01-06 11:38:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:47,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 11:38:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:47,021 INFO L225 Difference]: With dead ends: 2051 [2021-01-06 11:38:47,022 INFO L226 Difference]: Without dead ends: 1146 [2021-01-06 11:38:47,023 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:38:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-01-06 11:38:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-01-06 11:38:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2021-01-06 11:38:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1536 transitions. [2021-01-06 11:38:47,055 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1536 transitions. Word has length 133 [2021-01-06 11:38:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:47,056 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1536 transitions. [2021-01-06 11:38:47,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1536 transitions. [2021-01-06 11:38:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-06 11:38:47,059 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:47,059 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:38:47,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:38:47,059 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:38:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:47,060 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2021-01-06 11:38:47,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:47,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930745923] [2021-01-06 11:38:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:38:47,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:38:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:38:47,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:38:47,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:38:47,586 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:38:47,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:38:47,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:38:47 BoogieIcfgContainer [2021-01-06 11:38:47,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:38:47,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:38:47,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:38:47,720 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:38:47,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:38:25" (3/4) ... [2021-01-06 11:38:47,724 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:38:47,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:38:47,726 INFO L168 Benchmark]: Toolchain (without parser) took 24254.08 ms. Allocated memory was 155.2 MB in the beginning and 293.6 MB in the end (delta: 138.4 MB). Free memory was 135.0 MB in the beginning and 231.0 MB in the end (delta: -96.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,727 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 155.2 MB. Free memory is still 128.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:38:47,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.48 ms. Allocated memory is still 155.2 MB. Free memory was 135.0 MB in the beginning and 125.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.72 ms. Allocated memory is still 155.2 MB. Free memory was 125.4 MB in the beginning and 120.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,728 INFO L168 Benchmark]: Boogie Preprocessor took 75.38 ms. Allocated memory is still 155.2 MB. Free memory was 120.7 MB in the beginning and 114.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,728 INFO L168 Benchmark]: RCFGBuilder took 1294.74 ms. Allocated memory is still 155.2 MB. Free memory was 114.4 MB in the beginning and 83.4 MB in the end (delta: 31.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,729 INFO L168 Benchmark]: TraceAbstraction took 21856.79 ms. Allocated memory was 155.2 MB in the beginning and 293.6 MB in the end (delta: 138.4 MB). Free memory was 82.9 MB in the beginning and 231.5 MB in the end (delta: -148.6 MB). Peak memory consumption was 132.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:38:47,729 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 293.6 MB. Free memory was 231.5 MB in the beginning and 231.0 MB in the end (delta: 505.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:38:47,733 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.20 ms. Allocated memory is still 155.2 MB. Free memory is still 128.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 869.48 ms. Allocated memory is still 155.2 MB. Free memory was 135.0 MB in the beginning and 125.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 142.72 ms. Allocated memory is still 155.2 MB. Free memory was 125.4 MB in the beginning and 120.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 75.38 ms. Allocated memory is still 155.2 MB. Free memory was 120.7 MB in the beginning and 114.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1294.74 ms. Allocated memory is still 155.2 MB. Free memory was 114.4 MB in the beginning and 83.4 MB in the end (delta: 31.0 MB). Peak memory consumption was 38.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21856.79 ms. Allocated memory was 155.2 MB in the beginning and 293.6 MB in the end (delta: 138.4 MB). Free memory was 82.9 MB in the beginning and 231.5 MB in the end (delta: -148.6 MB). Peak memory consumption was 132.4 MB. Max. memory is 8.0 GB. * Witness Printer took 4.58 ms. Allocated memory is still 293.6 MB. Free memory was 231.5 MB in the beginning and 231.0 MB in the end (delta: 505.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: 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 1331. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={5:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 ; [L1094] int tmp___4 ; [L1095] int tmp___5 ; [L1096] int tmp___6 ; [L1097] int tmp___7 ; [L1098] int tmp___8 ; [L1099] long tmp___9 ; [L1101] int blastFlag ; [L1104] blastFlag = 0 [L1105] s->hit=__VERIFIER_nondet_int () [L1106] s->state = 12292 [L1107] tmp = __VERIFIER_nondet_int() [L1108] cb = (void (*)())((void *)0) [L1109] ret = -1 [L1110] skip = 0 [L1111] EXPR s->info_callback VAL [init=1, SSLv3_client_data={5:0}] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={5:0}] [L1250] EXPR s->version VAL [init=1, SSLv3_client_data={5:0}] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [init=1, SSLv3_client_data={5:0}] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={5:0}] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [init=1, SSLv3_client_data={5:0}] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={5:0}] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [init=1, SSLv3_client_data={5:0}] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [init=1, SSLv3_client_data={5:0}] [L1327] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={5:0}] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={5:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={5:0}] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={5:0}] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={5:0}] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={5:0}] [L1646] reach_error() VAL [init=1, SSLv3_client_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.6s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7362 SDtfs, 2436 SDslu, 9320 SDs, 0 SdLazy, 5220 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1025occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 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...