/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:12,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:12,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:12,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:12,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:12,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:12,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:12,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:12,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:12,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:12,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:12,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:12,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:12,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:12,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:12,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:12,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:12,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:12,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:12,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:12,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:12,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:12,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:12,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:12,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:12,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:12,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:12,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:12,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:12,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:12,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:12,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:12,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:12,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:12,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:12,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:12,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:12,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:12,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:12,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:12,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:12,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:12,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:12,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:12,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:12,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:12,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:12,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:12,923 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:12,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:12,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:12,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:12,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:12,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:12,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:12,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:12,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:12,926 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:12,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:12,927 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:12,927 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:30:13,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:13,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:13,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:13,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:13,140 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:13,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-01-11 03:30:13,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753085016/bb05e3eb80b44fd3bd5b50abc3442366/FLAG40c24b2e9 [2022-01-11 03:30:13,604 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:13,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-01-11 03:30:13,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753085016/bb05e3eb80b44fd3bd5b50abc3442366/FLAG40c24b2e9 [2022-01-11 03:30:13,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/753085016/bb05e3eb80b44fd3bd5b50abc3442366 [2022-01-11 03:30:13,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:13,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:13,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:13,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:13,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:13,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e845c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13, skipping insertion in model container [2022-01-11 03:30:13,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:13,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:13,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c[45032,45045] [2022-01-11 03:30:13,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:13,901 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:13,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c[45032,45045] [2022-01-11 03:30:13,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:13,952 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:13,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13 WrapperNode [2022-01-11 03:30:13,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:13,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:13,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:13,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:13,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,985 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 527 [2022-01-11 03:30:13,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:13,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:13,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:13,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:13,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:13,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:14,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:14,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:14,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:14,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:14,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:14,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:14,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:14,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (1/1) ... [2022-01-11 03:30:14,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:14,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:30:14,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:30:14,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:14,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:14,139 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:14,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:14,149 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 03:30:14,541 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-11 03:30:14,541 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-11 03:30:14,541 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:14,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:14,546 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:14,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:14 BoogieIcfgContainer [2022-01-11 03:30:14,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:14,548 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:14,548 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:14,552 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:14,554 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:14" (1/1) ... [2022-01-11 03:30:14,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:14 BasicIcfg [2022-01-11 03:30:14,682 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:14,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:14,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:14,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:14,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:13" (1/4) ... [2022-01-11 03:30:14,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18442af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:14, skipping insertion in model container [2022-01-11 03:30:14,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:13" (2/4) ... [2022-01-11 03:30:14,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18442af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:14, skipping insertion in model container [2022-01-11 03:30:14,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:14" (3/4) ... [2022-01-11 03:30:14,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18442af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:14, skipping insertion in model container [2022-01-11 03:30:14,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:14" (4/4) ... [2022-01-11 03:30:14,687 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.cTransformedIcfg [2022-01-11 03:30:14,690 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:14,690 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:14,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:14,744 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:30:14,744 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 151 states have (on average 1.7417218543046358) internal successors, (263), 152 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 03:30:14,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:14,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:14,758 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:14,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -685310172, now seen corresponding path program 1 times [2022-01-11 03:30:14,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:14,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823772402] [2022-01-11 03:30:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:14,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:14,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:14,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823772402] [2022-01-11 03:30:14,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823772402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:14,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:14,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:14,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196924203] [2022-01-11 03:30:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:14,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:14,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:14,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:14,999 INFO L87 Difference]: Start difference. First operand has 153 states, 151 states have (on average 1.7417218543046358) internal successors, (263), 152 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:15,204 INFO L93 Difference]: Finished difference Result 364 states and 632 transitions. [2022-01-11 03:30:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:15,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 03:30:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:15,212 INFO L225 Difference]: With dead ends: 364 [2022-01-11 03:30:15,212 INFO L226 Difference]: Without dead ends: 185 [2022-01-11 03:30:15,215 INFO L932 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 [2022-01-11 03:30:15,217 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 87 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:15,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 429 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-01-11 03:30:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-01-11 03:30:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4918032786885247) internal successors, (273), 183 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 273 transitions. [2022-01-11 03:30:15,249 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 273 transitions. Word has length 26 [2022-01-11 03:30:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,249 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 273 transitions. [2022-01-11 03:30:15,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 273 transitions. [2022-01-11 03:30:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 03:30:15,250 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:15,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:15,251 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2006823550, now seen corresponding path program 1 times [2022-01-11 03:30:15,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060214342] [2022-01-11 03:30:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:15,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060214342] [2022-01-11 03:30:15,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060214342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:15,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:15,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:15,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559402227] [2022-01-11 03:30:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:15,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:15,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:15,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:15,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:15,304 INFO L87 Difference]: Start difference. First operand 184 states and 273 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:15,500 INFO L93 Difference]: Finished difference Result 409 states and 623 transitions. [2022-01-11 03:30:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:15,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 03:30:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:15,506 INFO L225 Difference]: With dead ends: 409 [2022-01-11 03:30:15,507 INFO L226 Difference]: Without dead ends: 221 [2022-01-11 03:30:15,513 INFO L932 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 [2022-01-11 03:30:15,514 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 85 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:15,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 277 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:30:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-01-11 03:30:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2022-01-11 03:30:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4951456310679612) internal successors, (308), 206 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 308 transitions. [2022-01-11 03:30:15,534 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 308 transitions. Word has length 27 [2022-01-11 03:30:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,535 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 308 transitions. [2022-01-11 03:30:15,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 308 transitions. [2022-01-11 03:30:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:30:15,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:15,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:15,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1203664654, now seen corresponding path program 1 times [2022-01-11 03:30:15,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319440043] [2022-01-11 03:30:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:15,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319440043] [2022-01-11 03:30:15,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319440043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:15,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:15,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:15,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454889458] [2022-01-11 03:30:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:15,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:15,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:15,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:15,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:15,593 INFO L87 Difference]: Start difference. First operand 207 states and 308 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:15,743 INFO L93 Difference]: Finished difference Result 457 states and 697 transitions. [2022-01-11 03:30:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 03:30:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:15,744 INFO L225 Difference]: With dead ends: 457 [2022-01-11 03:30:15,745 INFO L226 Difference]: Without dead ends: 246 [2022-01-11 03:30:15,747 INFO L932 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 [2022-01-11 03:30:15,752 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 92 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:15,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 273 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-01-11 03:30:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 231. [2022-01-11 03:30:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-01-11 03:30:15,766 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 30 [2022-01-11 03:30:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,766 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-01-11 03:30:15,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-01-11 03:30:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 03:30:15,768 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:15,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:15,768 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1551107258, now seen corresponding path program 1 times [2022-01-11 03:30:15,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384141018] [2022-01-11 03:30:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:15,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384141018] [2022-01-11 03:30:15,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384141018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:15,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:15,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 03:30:15,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69734007] [2022-01-11 03:30:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:15,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 03:30:15,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 03:30:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 03:30:15,837 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:15,959 INFO L93 Difference]: Finished difference Result 494 states and 733 transitions. [2022-01-11 03:30:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 03:30:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-11 03:30:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:15,961 INFO L225 Difference]: With dead ends: 494 [2022-01-11 03:30:15,962 INFO L226 Difference]: Without dead ends: 271 [2022-01-11 03:30:15,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:15,966 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 193 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:15,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 356 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-01-11 03:30:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 240. [2022-01-11 03:30:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.506276150627615) internal successors, (360), 239 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2022-01-11 03:30:15,985 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 42 [2022-01-11 03:30:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:15,985 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2022-01-11 03:30:15,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2022-01-11 03:30:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 03:30:15,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:15,987 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 03:30:15,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:15,987 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1721762506, now seen corresponding path program 1 times [2022-01-11 03:30:15,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563649643] [2022-01-11 03:30:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:15,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:16,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563649643] [2022-01-11 03:30:16,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563649643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783781341] [2022-01-11 03:30:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,025 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,137 INFO L93 Difference]: Finished difference Result 519 states and 795 transitions. [2022-01-11 03:30:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 03:30:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,140 INFO L225 Difference]: With dead ends: 519 [2022-01-11 03:30:16,140 INFO L226 Difference]: Without dead ends: 287 [2022-01-11 03:30:16,140 INFO L932 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 [2022-01-11 03:30:16,141 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 71 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 353 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-11 03:30:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2022-01-11 03:30:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4609929078014185) internal successors, (412), 282 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 412 transitions. [2022-01-11 03:30:16,147 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 412 transitions. Word has length 52 [2022-01-11 03:30:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,150 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 412 transitions. [2022-01-11 03:30:16,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 412 transitions. [2022-01-11 03:30:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 03:30:16,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,159 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 03:30:16,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:16,159 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1592679787, now seen corresponding path program 1 times [2022-01-11 03:30:16,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646029863] [2022-01-11 03:30:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 03:30:16,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646029863] [2022-01-11 03:30:16,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646029863] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572176232] [2022-01-11 03:30:16,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,201 INFO L87 Difference]: Start difference. First operand 283 states and 412 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,318 INFO L93 Difference]: Finished difference Result 609 states and 905 transitions. [2022-01-11 03:30:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 03:30:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,320 INFO L225 Difference]: With dead ends: 609 [2022-01-11 03:30:16,320 INFO L226 Difference]: Without dead ends: 322 [2022-01-11 03:30:16,321 INFO L932 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 [2022-01-11 03:30:16,322 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 98 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 282 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-11 03:30:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 309. [2022-01-11 03:30:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4772727272727273) internal successors, (455), 308 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 455 transitions. [2022-01-11 03:30:16,330 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 455 transitions. Word has length 52 [2022-01-11 03:30:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,331 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 455 transitions. [2022-01-11 03:30:16,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 455 transitions. [2022-01-11 03:30:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 03:30:16,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:16,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:16,332 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1587804409, now seen corresponding path program 1 times [2022-01-11 03:30:16,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767274848] [2022-01-11 03:30:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-11 03:30:16,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767274848] [2022-01-11 03:30:16,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767274848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519606237] [2022-01-11 03:30:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,377 INFO L87 Difference]: Start difference. First operand 309 states and 455 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,406 INFO L93 Difference]: Finished difference Result 886 states and 1301 transitions. [2022-01-11 03:30:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-01-11 03:30:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,408 INFO L225 Difference]: With dead ends: 886 [2022-01-11 03:30:16,408 INFO L226 Difference]: Without dead ends: 585 [2022-01-11 03:30:16,409 INFO L932 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 [2022-01-11 03:30:16,409 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 166 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 407 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-11 03:30:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2022-01-11 03:30:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4553264604810996) internal successors, (847), 582 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 847 transitions. [2022-01-11 03:30:16,420 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 847 transitions. Word has length 62 [2022-01-11 03:30:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,421 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 847 transitions. [2022-01-11 03:30:16,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 847 transitions. [2022-01-11 03:30:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-11 03:30:16,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:16,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:16,440 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -344030679, now seen corresponding path program 1 times [2022-01-11 03:30:16,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808171811] [2022-01-11 03:30:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 03:30:16,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808171811] [2022-01-11 03:30:16,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808171811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765458106] [2022-01-11 03:30:16,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,470 INFO L87 Difference]: Start difference. First operand 583 states and 847 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,487 INFO L93 Difference]: Finished difference Result 1170 states and 1698 transitions. [2022-01-11 03:30:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-01-11 03:30:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,489 INFO L225 Difference]: With dead ends: 1170 [2022-01-11 03:30:16,489 INFO L226 Difference]: Without dead ends: 595 [2022-01-11 03:30:16,489 INFO L932 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 [2022-01-11 03:30:16,490 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 3 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 431 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-01-11 03:30:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2022-01-11 03:30:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.4510135135135136) internal successors, (859), 592 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 859 transitions. [2022-01-11 03:30:16,500 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 859 transitions. Word has length 64 [2022-01-11 03:30:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,500 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 859 transitions. [2022-01-11 03:30:16,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 859 transitions. [2022-01-11 03:30:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 03:30:16,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:16,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:16,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1441595169, now seen corresponding path program 1 times [2022-01-11 03:30:16,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021801479] [2022-01-11 03:30:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-11 03:30:16,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021801479] [2022-01-11 03:30:16,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021801479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258393008] [2022-01-11 03:30:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,531 INFO L87 Difference]: Start difference. First operand 593 states and 859 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,661 INFO L93 Difference]: Finished difference Result 1306 states and 1933 transitions. [2022-01-11 03:30:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 03:30:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,664 INFO L225 Difference]: With dead ends: 1306 [2022-01-11 03:30:16,664 INFO L226 Difference]: Without dead ends: 697 [2022-01-11 03:30:16,665 INFO L932 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 [2022-01-11 03:30:16,666 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 121 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 276 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-01-11 03:30:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 655. [2022-01-11 03:30:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.4694189602446484) internal successors, (961), 654 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 961 transitions. [2022-01-11 03:30:16,679 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 961 transitions. Word has length 66 [2022-01-11 03:30:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,680 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 961 transitions. [2022-01-11 03:30:16,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 961 transitions. [2022-01-11 03:30:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 03:30:16,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:16,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:16,681 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -715417062, now seen corresponding path program 1 times [2022-01-11 03:30:16,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930171970] [2022-01-11 03:30:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 03:30:16,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930171970] [2022-01-11 03:30:16,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930171970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:16,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:16,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:16,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618376034] [2022-01-11 03:30:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:16,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:16,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:16,737 INFO L87 Difference]: Start difference. First operand 655 states and 961 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:16,851 INFO L93 Difference]: Finished difference Result 1406 states and 2086 transitions. [2022-01-11 03:30:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-01-11 03:30:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:16,854 INFO L225 Difference]: With dead ends: 1406 [2022-01-11 03:30:16,854 INFO L226 Difference]: Without dead ends: 737 [2022-01-11 03:30:16,854 INFO L932 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 [2022-01-11 03:30:16,855 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:16,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 224 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-01-11 03:30:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 713. [2022-01-11 03:30:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.4634831460674158) internal successors, (1042), 712 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1042 transitions. [2022-01-11 03:30:16,868 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1042 transitions. Word has length 70 [2022-01-11 03:30:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:16,869 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1042 transitions. [2022-01-11 03:30:16,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1042 transitions. [2022-01-11 03:30:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-11 03:30:16,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:16,870 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:16,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:16,870 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash -603537805, now seen corresponding path program 1 times [2022-01-11 03:30:16,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:16,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71704607] [2022-01-11 03:30:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:16,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71704607] [2022-01-11 03:30:16,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71704607] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:30:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875129388] [2022-01-11 03:30:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:16,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:30:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:16,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 03:30:16,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 03:30:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:17,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-11 03:30:17,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:30:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 03:30:17,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 03:30:17,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875129388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:17,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 03:30:17,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-11 03:30:17,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481329176] [2022-01-11 03:30:17,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:17,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:17,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:17,180 INFO L87 Difference]: Start difference. First operand 713 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:17,293 INFO L93 Difference]: Finished difference Result 1120 states and 1635 transitions. [2022-01-11 03:30:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:17,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-11 03:30:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:17,294 INFO L225 Difference]: With dead ends: 1120 [2022-01-11 03:30:17,294 INFO L226 Difference]: Without dead ends: 411 [2022-01-11 03:30:17,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 03:30:17,296 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:17,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-01-11 03:30:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2022-01-11 03:30:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2022-01-11 03:30:17,303 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 83 [2022-01-11 03:30:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:17,303 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2022-01-11 03:30:17,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2022-01-11 03:30:17,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-11 03:30:17,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:17,304 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:17,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 03:30:17,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-11 03:30:17,520 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1166111989, now seen corresponding path program 1 times [2022-01-11 03:30:17,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991403422] [2022-01-11 03:30:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:17,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-11 03:30:17,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991403422] [2022-01-11 03:30:17,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991403422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:17,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:17,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:17,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020968015] [2022-01-11 03:30:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:17,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:17,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:17,548 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:17,672 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2022-01-11 03:30:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:17,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-01-11 03:30:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:17,674 INFO L225 Difference]: With dead ends: 807 [2022-01-11 03:30:17,674 INFO L226 Difference]: Without dead ends: 420 [2022-01-11 03:30:17,675 INFO L932 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 [2022-01-11 03:30:17,675 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 154 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:17,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 211 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:30:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-01-11 03:30:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-01-11 03:30:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.393120393120393) internal successors, (567), 407 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 567 transitions. [2022-01-11 03:30:17,684 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 567 transitions. Word has length 92 [2022-01-11 03:30:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:17,684 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 567 transitions. [2022-01-11 03:30:17,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 567 transitions. [2022-01-11 03:30:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 03:30:17,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:17,685 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:17,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:17,685 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -304493173, now seen corresponding path program 1 times [2022-01-11 03:30:17,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:17,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720881824] [2022-01-11 03:30:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:17,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-11 03:30:17,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:17,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720881824] [2022-01-11 03:30:17,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720881824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:17,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:17,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:17,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88120256] [2022-01-11 03:30:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:17,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:17,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:17,719 INFO L87 Difference]: Start difference. First operand 408 states and 567 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:17,755 INFO L93 Difference]: Finished difference Result 1182 states and 1651 transitions. [2022-01-11 03:30:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:17,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-01-11 03:30:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:17,757 INFO L225 Difference]: With dead ends: 1182 [2022-01-11 03:30:17,757 INFO L226 Difference]: Without dead ends: 795 [2022-01-11 03:30:17,758 INFO L932 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 [2022-01-11 03:30:17,758 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 175 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:17,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 396 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-01-11 03:30:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-01-11 03:30:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.3914141414141414) internal successors, (1102), 792 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1102 transitions. [2022-01-11 03:30:17,773 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1102 transitions. Word has length 102 [2022-01-11 03:30:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:17,773 INFO L470 AbstractCegarLoop]: Abstraction has 793 states and 1102 transitions. [2022-01-11 03:30:17,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1102 transitions. [2022-01-11 03:30:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-11 03:30:17,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:17,774 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-11 03:30:17,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:17,774 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash -597896180, now seen corresponding path program 1 times [2022-01-11 03:30:17,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:17,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443555490] [2022-01-11 03:30:17,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:17,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 03:30:17,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 03:30:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 03:30:17,870 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 03:30:17,870 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 03:30:17,871 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:17,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:17,874 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:17,876 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:18,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:18 BasicIcfg [2022-01-11 03:30:18,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:18,035 INFO L158 Benchmark]: Toolchain (without parser) took 4407.48ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 132.3MB in the beginning and 166.1MB in the end (delta: -33.9MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,035 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:18,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.48ms. Allocated memory is still 182.5MB. Free memory was 132.0MB in the beginning and 153.9MB in the end (delta: -21.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.98ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,036 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 148.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,036 INFO L158 Benchmark]: RCFGBuilder took 524.59ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 120.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,036 INFO L158 Benchmark]: IcfgTransformer took 133.97ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,037 INFO L158 Benchmark]: TraceAbstraction took 3351.47ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 105.2MB in the beginning and 166.1MB in the end (delta: -61.0MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:18,038 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.09ms. Allocated memory is still 182.5MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.48ms. Allocated memory is still 182.5MB. Free memory was 132.0MB in the beginning and 153.9MB in the end (delta: -21.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.98ms. Allocated memory is still 182.5MB. Free memory was 153.4MB in the beginning and 150.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 148.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 524.59ms. Allocated memory is still 182.5MB. Free memory was 148.7MB in the beginning and 120.4MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * IcfgTransformer took 133.97ms. Allocated memory is still 182.5MB. Free memory was 120.4MB in the beginning and 105.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3351.47ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 105.2MB in the beginning and 166.1MB in the end (delta: -61.0MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 654]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L659] int s ; [L660] int tmp ; [L664] s = 8464 [L665] CALL ssl3_accept(s) [L23] int s__info_callback = __VERIFIER_nondet_int() ; [L24] int s__in_handshake = __VERIFIER_nondet_int() ; [L25] int s__state ; [L26] int s__new_session ; [L27] int s__server ; [L28] int s__version = __VERIFIER_nondet_int() ; [L29] int s__type ; [L30] int s__init_num ; [L31] int s__hit = __VERIFIER_nondet_int() ; [L32] int s__rwstate ; [L33] int s__init_buf___0 = 1; [L34] int s__debug = __VERIFIER_nondet_int() ; [L35] int s__shutdown ; [L36] int s__cert = __VERIFIER_nondet_int() ; [L37] int s__options = __VERIFIER_nondet_int() ; [L38] int s__verify_mode = __VERIFIER_nondet_int() ; [L39] int s__session__peer = __VERIFIER_nondet_int() ; [L40] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L41] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L42] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L43] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L44] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L45] int s__s3__tmp__cert_request ; [L46] int s__s3__tmp__reuse_message ; [L47] int s__s3__tmp__use_rsa_tmp ; [L48] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L49] int s__s3__tmp__new_cipher__algorithms ; [L50] int s__s3__tmp__next_state___0 ; [L51] int s__s3__tmp__new_cipher__algo_strength ; [L52] int s__session__cipher ; [L53] int buf ; [L54] unsigned long l ; [L55] unsigned long Time ; [L56] unsigned long tmp ; [L57] int cb ; [L58] long num1 = __VERIFIER_nondet_long() ; [L59] int ret ; [L60] int new_state ; [L61] int state ; [L62] int skip ; [L63] int got_new_session ; [L64] int tmp___1 = __VERIFIER_nondet_int() ; [L65] int tmp___2 = __VERIFIER_nondet_int() ; [L66] int tmp___3 = __VERIFIER_nondet_int() ; [L67] int tmp___4 = __VERIFIER_nondet_int() ; [L68] int tmp___5 = __VERIFIER_nondet_int() ; [L69] int tmp___6 = __VERIFIER_nondet_int() ; [L70] int tmp___7 = __VERIFIER_nondet_int() ; [L71] long tmp___8 = __VERIFIER_nondet_long() ; [L72] int tmp___9 = __VERIFIER_nondet_int() ; [L73] int tmp___10 = __VERIFIER_nondet_int() ; [L74] int blastFlag ; [L75] int __cil_tmp55 ; [L76] unsigned long __cil_tmp56 ; [L77] unsigned long __cil_tmp57 ; [L78] unsigned long __cil_tmp58 ; [L79] unsigned long __cil_tmp59 ; [L80] int __cil_tmp60 ; [L81] unsigned long __cil_tmp61 ; [L84] s__state = initial_state [L85] blastFlag = 0 [L86] tmp = __VERIFIER_nondet_int() [L87] Time = tmp [L88] cb = 0 [L89] ret = -1 [L90] skip = 0 [L91] got_new_session = 0 VAL [\old(initial_state)=8464, blastFlag=0, cb=0, got_new_session=0, initial_state=8464, ret=4294967295, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0] [L92] COND TRUE s__info_callback != 0 [L93] cb = s__info_callback VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0] [L99] s__in_handshake ++ VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0] [L100] COND FALSE !(tmp___1 + 12288) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=4294955008] [L105] COND FALSE !(s__cert == 0) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=4294955008] [L109] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, Time=0, tmp=0, tmp___1=4294955008] [L111] state = s__state VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L112] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L115] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L118] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L121] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L124] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L127] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L130] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L133] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L136] COND TRUE s__state == 8464 VAL [\old(initial_state)=8464, blastFlag=0, cb=1, got_new_session=0, initial_state=8464, ret=4294967295, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L282] s__shutdown = 0 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 0 [L285] blastFlag = 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=0, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__shutdown=0, s__state=8464, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L287] COND FALSE !(ret <= 0) [L290] got_new_session = 1 [L291] s__state = 8496 [L292] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L611] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L612] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L643] skip = 0 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L109] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8464, Time=0, tmp=0, tmp___1=4294955008] [L111] state = s__state VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L112] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L115] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L118] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L121] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L124] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L127] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L130] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L133] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L136] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L139] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L142] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L145] COND TRUE s__state == 8496 VAL [\old(initial_state)=8464, blastFlag=1, cb=1, got_new_session=1, initial_state=8464, ret=5, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L296] ret = __VERIFIER_nondet_int() [L297] COND TRUE blastFlag == 1 [L298] blastFlag = 2 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L300] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8496, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L303] COND FALSE !(\read(s__hit)) [L306] s__state = 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L308] s__init_num = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L611] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L612] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L643] skip = 0 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L109] COND TRUE 1 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8496, Time=0, tmp=0, tmp___1=4294955008] [L111] state = s__state VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L112] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L115] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L118] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L121] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L124] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L127] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L130] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L133] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L136] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L139] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L142] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L145] COND FALSE !(s__state == 8496) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L148] COND FALSE !(s__state == 8497) VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L151] COND TRUE s__state == 8512 VAL [\old(initial_state)=8464, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L313] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L314] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L315] COND TRUE __cil_tmp56 + 256UL [L316] skip = 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8512, skip=1, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L327] s__state = 8528 [L328] s__init_num = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=1, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L611] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L612] COND FALSE !(! s__s3__tmp__reuse_message) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=1, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L643] skip = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L109] COND TRUE 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8512, Time=0, tmp=0, tmp___1=4294955008] [L111] state = s__state VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L112] COND FALSE !(s__state == 12292) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L115] COND FALSE !(s__state == 16384) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L118] COND FALSE !(s__state == 8192) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L121] COND FALSE !(s__state == 24576) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L124] COND FALSE !(s__state == 8195) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L127] COND FALSE !(s__state == 8480) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L130] COND FALSE !(s__state == 8481) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L133] COND FALSE !(s__state == 8482) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L136] COND FALSE !(s__state == 8464) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L139] COND FALSE !(s__state == 8465) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L142] COND FALSE !(s__state == 8466) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L145] COND FALSE !(s__state == 8496) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L148] COND FALSE !(s__state == 8497) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L151] COND FALSE !(s__state == 8512) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L154] COND FALSE !(s__state == 8513) VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L157] COND TRUE s__state == 8528 VAL [\old(initial_state)=8464, __cil_tmp56=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L332] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L333] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L335] __cil_tmp57 = (unsigned long )s__options VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L336] COND TRUE __cil_tmp57 + 2097152UL [L337] s__s3__tmp__use_rsa_tmp = 1 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L342] COND TRUE \read(s__s3__tmp__use_rsa_tmp) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L369] ret = __VERIFIER_nondet_int() [L370] COND FALSE !(blastFlag == 6) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L373] COND FALSE !(ret <= 0) VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8528, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L390] s__state = 8544 [L391] s__init_num = 0 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L611] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L612] COND TRUE ! s__s3__tmp__reuse_message VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L613] COND TRUE ! skip VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L614] COND TRUE state == 8528 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L615] COND TRUE s__state == 8544 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008] [L616] COND TRUE tmp___7 != 1024 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008, tmp___7=0] [L617] COND TRUE tmp___7 != 512 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008, tmp___7=0] [L618] COND TRUE __cil_tmp58 != 4294967294 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008, tmp___7=0] [L619] COND TRUE l != 4294967266 VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008, tmp___7=0] [L654] reach_error() VAL [\old(initial_state)=8464, __cil_tmp56=0, __cil_tmp57=0, __cil_tmp58=0, blastFlag=2, cb=1, got_new_session=1, initial_state=8464, l=0, ret=1, s__cert=4, s__hit=0, s__in_handshake=1, s__info_callback=1, s__init_buf___0=1, s__init_num=0, s__options=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=0, s__s3__tmp__use_rsa_tmp=1, s__shutdown=0, s__state=8544, skip=0, state=8528, Time=0, tmp=0, tmp___1=4294955008, tmp___7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1449 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1449 mSDsluCounter, 4227 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1612 mSDsCounter, 403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1365 IncrementalHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 403 mSolverCounterUnsat, 2615 mSDtfsCounter, 1365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=13, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 165 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 837 ConstructedInterpolants, 0 QuantifiedInterpolants, 1395 SizeOfPredicates, 3 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 330/351 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 proved your program to be incorrect! [2022-01-11 03:30:18,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...