/usr/bin/java -ea -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:54:50,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:54:50,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:54:50,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:54:50,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:54:50,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:54:50,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:54:50,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:54:50,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:54:50,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:54:50,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:54:50,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:54:50,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:54:50,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:54:50,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:54:50,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:54:50,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:54:50,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:54:50,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:54:50,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:54:50,726 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:54:50,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:54:50,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:54:50,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:54:50,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:54:50,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:54:50,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:54:50,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:54:50,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:54:50,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:54:50,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:54:50,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:54:50,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:54:50,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:54:50,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:54:50,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:54:50,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:54:50,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:54:50,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:54:50,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:54:50,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:54:50,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:54:50,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:54:50,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:54:50,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:54:50,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:54:50,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:54:50,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:54:50,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:54:50,775 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:54:50,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:54:50,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:54:50,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:54:50,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:54:50,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:54:50,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:54:50,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:54:50,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:54:50,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:54:50,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:54:50,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:54:50,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:54:50,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:54:50,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:54:50,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:54:50,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:54:50,780 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:54:50,780 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-08 02:54:51,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:54:51,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:54:51,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:54:51,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:54:51,038 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:54:51,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-08 02:54:51,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf34729aa/144017623aa041d6bb917751296c3b25/FLAG689acb8b9 [2022-04-08 02:54:51,480 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:54:51,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-08 02:54:51,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf34729aa/144017623aa041d6bb917751296c3b25/FLAG689acb8b9 [2022-04-08 02:54:51,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf34729aa/144017623aa041d6bb917751296c3b25 [2022-04-08 02:54:51,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:54:51,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:54:51,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:54:51,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:54:51,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:54:51,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daee54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51, skipping insertion in model container [2022-04-08 02:54:51,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:54:51,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:54:51,702 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_1a.cil.c[14184,14197] [2022-04-08 02:54:51,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:54:51,725 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:54:51,744 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_1a.cil.c[14184,14197] [2022-04-08 02:54:51,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:54:51,755 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:54:51,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51 WrapperNode [2022-04-08 02:54:51,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:54:51,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:54:51,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:54:51,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:54:51,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:54:51,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:54:51,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:54:51,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:54:51,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (1/1) ... [2022-04-08 02:54:51,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:54:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:54:51,821 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-04-08 02:54:51,823 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-04-08 02:54:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:54:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:54:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:54:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 02:54:51,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:54:51,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:54:51,899 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:54:51,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:54:52,121 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:54:52,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:54:52,129 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:54:52,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:54:52 BoogieIcfgContainer [2022-04-08 02:54:52,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:54:52,132 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:54:52,132 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:54:52,133 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:54:52,136 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:54:52" (1/1) ... [2022-04-08 02:54:52,137 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:54:52,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:54:52 BasicIcfg [2022-04-08 02:54:52,167 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:54:52,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:54:52,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:54:52,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:54:52,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:54:51" (1/4) ... [2022-04-08 02:54:52,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fedb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:54:52, skipping insertion in model container [2022-04-08 02:54:52,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:54:51" (2/4) ... [2022-04-08 02:54:52,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fedb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:54:52, skipping insertion in model container [2022-04-08 02:54:52,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:54:52" (3/4) ... [2022-04-08 02:54:52,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fedb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:54:52, skipping insertion in model container [2022-04-08 02:54:52,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:54:52" (4/4) ... [2022-04-08 02:54:52,181 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.cqvasr [2022-04-08 02:54:52,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:54:52,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:54:52,225 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:54:52,229 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-08 02:54:52,230 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:54:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 02:54:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 02:54:52,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:52,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:52,254 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1676912857, now seen corresponding path program 1 times [2022-04-08 02:54:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833218873] [2022-04-08 02:54:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:52,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {54#true} is VALID [2022-04-08 02:54:52,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:54:52,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:54:52,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:52,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {54#true} is VALID [2022-04-08 02:54:52,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:54:52,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:54:52,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-08 02:54:52,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {59#(= main_~blastFlag~0 0)} is VALID [2022-04-08 02:54:52,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59#(= main_~blastFlag~0 0)} is VALID [2022-04-08 02:54:52,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#(= main_~blastFlag~0 0)} [213] L35-->L185: Formula: (and (< 2 v_main_~blastFlag~0_3) (<= v_main_~s__state~0_8 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-08 02:54:52,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55#false} is VALID [2022-04-08 02:54:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:54:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833218873] [2022-04-08 02:54:52,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833218873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:52,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:52,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576411793] [2022-04-08 02:54:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:52,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 02:54:52,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:52,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:52,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:52,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:52,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:52,564 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:52,971 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-08 02:54:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 02:54:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 02:54:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 02:54:52,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-08 02:54:53,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:53,217 INFO L225 Difference]: With dead ends: 136 [2022-04-08 02:54:53,218 INFO L226 Difference]: Without dead ends: 83 [2022-04-08 02:54:53,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-04-08 02:54:53,223 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:53,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-08 02:54:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-08 02:54:53,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:53,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,255 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,256 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:53,261 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 02:54:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 02:54:53,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:53,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:53,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 02:54:53,263 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 02:54:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:53,268 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 02:54:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 02:54:53,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:53,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:53,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:53,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-08 02:54:53,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-08 02:54:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:53,275 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-08 02:54:53,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 02:54:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 02:54:53,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:53,276 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:53,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:54:53,277 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 141831786, now seen corresponding path program 1 times [2022-04-08 02:54:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:53,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751541940] [2022-04-08 02:54:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:53,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {539#true} is VALID [2022-04-08 02:54:53,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:53,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {539#true} is VALID [2022-04-08 02:54:53,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {539#true} is VALID [2022-04-08 02:54:53,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {539#true} is VALID [2022-04-08 02:54:53,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:53,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:53,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:53,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} [213] L35-->L185: Formula: (and (< 2 v_main_~blastFlag~0_3) (<= v_main_~s__state~0_8 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {540#false} is VALID [2022-04-08 02:54:53,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {540#false} is VALID [2022-04-08 02:54:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 02:54:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:53,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751541940] [2022-04-08 02:54:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751541940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:53,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540194093] [2022-04-08 02:54:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 02:54:53,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:53,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:53,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:53,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:53,355 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:53,602 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-08 02:54:53,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 02:54:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 02:54:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-08 02:54:53,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-08 02:54:53,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:53,789 INFO L225 Difference]: With dead ends: 160 [2022-04-08 02:54:53,790 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 02:54:53,790 INFO L912 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-04-08 02:54:53,791 INFO L913 BasicCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:53,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 02:54:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-08 02:54:53,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:53,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,804 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,804 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:53,809 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-08 02:54:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 02:54:53,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:53,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:53,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-08 02:54:53,821 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 120 states. [2022-04-08 02:54:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:53,826 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-08 02:54:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 02:54:53,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:53,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:53,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:53,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-08 02:54:53,832 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-08 02:54:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:53,832 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-08 02:54:53,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-08 02:54:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:54:53,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:53,833 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:53,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 02:54:53,834 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1247550592, now seen corresponding path program 1 times [2022-04-08 02:54:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:53,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989294388] [2022-04-08 02:54:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:53,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1187#true} is VALID [2022-04-08 02:54:53,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:53,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1187#true} is VALID [2022-04-08 02:54:53,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {1187#true} is VALID [2022-04-08 02:54:53,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {1187#true} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {1187#true} is VALID [2022-04-08 02:54:53,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {1187#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {1187#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1187#true} [222] L44-->L45: Formula: (= v_main_~s__state~0_15 8496) InVars {main_~s__state~0=v_main_~s__state~0_15} OutVars{main_~s__state~0=v_main_~s__state~0_15} AuxVars[] AssignedVars[] {1187#true} is VALID [2022-04-08 02:54:53,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#true} [225] L45-->L97-1: Formula: (and (= 2 v_main_~blastFlag~0_19) (= v_main_~blastFlag~0_20 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0] {1187#true} is VALID [2022-04-08 02:54:53,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {1187#true} [229] L97-1-->L188: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_41 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_41, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {1192#(<= 8656 main_~s__state~0)} is VALID [2022-04-08 02:54:53,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(<= 8656 main_~s__state~0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1192#(<= 8656 main_~s__state~0)} is VALID [2022-04-08 02:54:53,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= 8656 main_~s__state~0)} [213] L35-->L185: Formula: (and (< 2 v_main_~blastFlag~0_3) (<= v_main_~s__state~0_8 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1188#false} is VALID [2022-04-08 02:54:53,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#false} is VALID [2022-04-08 02:54:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 02:54:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:53,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989294388] [2022-04-08 02:54:53,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989294388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:53,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:53,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983993171] [2022-04-08 02:54:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:54:53,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:53,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:53,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:53,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:53,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:53,909 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,125 INFO L93 Difference]: Finished difference Result 278 states and 429 transitions. [2022-04-08 02:54:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:54:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-08 02:54:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-08 02:54:54,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-04-08 02:54:54,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:54,255 INFO L225 Difference]: With dead ends: 278 [2022-04-08 02:54:54,255 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 02:54:54,256 INFO L912 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-04-08 02:54:54,257 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:54,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 02:54:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2022-04-08 02:54:54,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:54,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,274 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,275 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,280 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2022-04-08 02:54:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2022-04-08 02:54:54,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:54,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:54,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-08 02:54:54,282 INFO L87 Difference]: Start difference. First operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 164 states. [2022-04-08 02:54:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,288 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2022-04-08 02:54:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2022-04-08 02:54:54,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:54,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:54,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:54,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 152 states have (on average 1.394736842105263) internal successors, (212), 152 states have internal predecessors, (212), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2022-04-08 02:54:54,295 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 20 [2022-04-08 02:54:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:54,295 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-04-08 02:54:54,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-04-08 02:54:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:54:54,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:54,296 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:54,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 02:54:54,297 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:54,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1247520801, now seen corresponding path program 1 times [2022-04-08 02:54:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:54,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600140384] [2022-04-08 02:54:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:54,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:54,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {2120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2114#true} is VALID [2022-04-08 02:54:54,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2114#true} {2114#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {2114#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:54,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {2120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2114#true} is VALID [2022-04-08 02:54:54,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {2114#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2114#true} {2114#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {2114#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2114#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {2114#true} is VALID [2022-04-08 02:54:54,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2114#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {2114#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2114#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2114#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {2114#true} is VALID [2022-04-08 02:54:54,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {2114#true} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {2114#true} is VALID [2022-04-08 02:54:54,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {2114#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {2114#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {2114#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {2114#true} [222] L44-->L45: Formula: (= v_main_~s__state~0_15 8496) InVars {main_~s__state~0=v_main_~s__state~0_15} OutVars{main_~s__state~0=v_main_~s__state~0_15} AuxVars[] AssignedVars[] {2114#true} is VALID [2022-04-08 02:54:54,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {2114#true} [225] L45-->L97-1: Formula: (and (= 2 v_main_~blastFlag~0_19) (= v_main_~blastFlag~0_20 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0] {2119#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {2119#(= (+ (- 2) main_~blastFlag~0) 0)} [230] L97-1-->L188: Formula: (and (= v_main_~s__state~0_42 8512) (= v_main_~s__hit~0_7 0)) InVars {main_~s__hit~0=v_main_~s__hit~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_42, main_~s__hit~0=v_main_~s__hit~0_7} AuxVars[] AssignedVars[main_~s__state~0] {2119#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {2119#(= (+ (- 2) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2119#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {2119#(= (+ (- 2) main_~blastFlag~0) 0)} [213] L35-->L185: Formula: (and (< 2 v_main_~blastFlag~0_3) (<= v_main_~s__state~0_8 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {2115#false} is VALID [2022-04-08 02:54:54,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {2115#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#false} is VALID [2022-04-08 02:54:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 02:54:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:54,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600140384] [2022-04-08 02:54:54,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600140384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:54,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:54,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457652734] [2022-04-08 02:54:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:54:54,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:54,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:54,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:54,364 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,593 INFO L93 Difference]: Finished difference Result 306 states and 431 transitions. [2022-04-08 02:54:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:54,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 02:54:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 02:54:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-08 02:54:54,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-08 02:54:54,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:54,755 INFO L225 Difference]: With dead ends: 306 [2022-04-08 02:54:54,755 INFO L226 Difference]: Without dead ends: 205 [2022-04-08 02:54:54,756 INFO L912 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-04-08 02:54:54,757 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:54,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 124 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-08 02:54:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-04-08 02:54:54,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:54,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,792 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,792 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,798 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions. [2022-04-08 02:54:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-08 02:54:54,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:54,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:54,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 02:54:54,800 INFO L87 Difference]: Start difference. First operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 205 states. [2022-04-08 02:54:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:54,806 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions. [2022-04-08 02:54:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-08 02:54:54,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:54,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:54,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:54,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 201 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 282 transitions. [2022-04-08 02:54:54,814 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 282 transitions. Word has length 20 [2022-04-08 02:54:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:54,815 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 282 transitions. [2022-04-08 02:54:54,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-08 02:54:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 02:54:54,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:54,816 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:54,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 02:54:54,817 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1375802200, now seen corresponding path program 1 times [2022-04-08 02:54:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:54,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345981464] [2022-04-08 02:54:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:54,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {3224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3218#true} is VALID [2022-04-08 02:54:54,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3218#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3218#true} {3218#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {3218#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:54,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3218#true} is VALID [2022-04-08 02:54:54,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3218#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3218#true} {3218#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {3218#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3218#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {3218#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {3218#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {3218#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {3218#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {3218#true} is VALID [2022-04-08 02:54:54,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3218#true} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {3218#true} is VALID [2022-04-08 02:54:54,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {3218#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {3218#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {3218#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {3218#true} [222] L44-->L45: Formula: (= v_main_~s__state~0_15 8496) InVars {main_~s__state~0=v_main_~s__state~0_15} OutVars{main_~s__state~0=v_main_~s__state~0_15} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {3218#true} [225] L45-->L97-1: Formula: (and (= 2 v_main_~blastFlag~0_19) (= v_main_~blastFlag~0_20 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {3218#true} [229] L97-1-->L188: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_41 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_41, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {3218#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {3218#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {3218#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {3218#true} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {3218#true} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {3218#true} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {3218#true} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {3218#true} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {3218#true} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#true} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {3218#true} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3218#true} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {3218#true} [266] L80-->L81: Formula: (= v_main_~s__state~0_36 8656) InVars {main_~s__state~0=v_main_~s__state~0_36} OutVars{main_~s__state~0=v_main_~s__state~0_36} AuxVars[] AssignedVars[] {3218#true} is VALID [2022-04-08 02:54:54,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {3218#true} [270] L81-->L174-1: Formula: (and (= v_main_~blastFlag~0_8 3) (= v_main_~blastFlag~0_9 2)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_8} AuxVars[] AssignedVars[main_~blastFlag~0] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [274] L174-1-->L188: Formula: (= v_main_~s__state~0_23 8672) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_23} AuxVars[] AssignedVars[main_~s__state~0] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [267] L80-->L84: Formula: (not (= v_main_~s__state~0_37 8656)) InVars {main_~s__state~0=v_main_~s__state~0_37} OutVars{main_~s__state~0=v_main_~s__state~0_37} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [272] L84-->L85: Formula: (= v_main_~s__state~0_38 8672) InVars {main_~s__state~0=v_main_~s__state~0_38} OutVars{main_~s__state~0=v_main_~s__state~0_38} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [276] L85-->L184: Formula: (not (= v_main_~blastFlag~0_13 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_13} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[] {3223#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-08 02:54:54,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {3223#(= (+ (- 3) main_~blastFlag~0) 0)} [279] L184-->L185: Formula: (= 5 v_main_~blastFlag~0_14) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_14} AuxVars[] AssignedVars[] {3219#false} is VALID [2022-04-08 02:54:54,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {3219#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3219#false} is VALID [2022-04-08 02:54:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 02:54:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:54,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345981464] [2022-04-08 02:54:54,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345981464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:54,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:54,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911308748] [2022-04-08 02:54:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 02:54:54,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:54,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:54,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:54,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:54,939 INFO L87 Difference]: Start difference. First operand 205 states and 282 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,176 INFO L93 Difference]: Finished difference Result 406 states and 566 transitions. [2022-04-08 02:54:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-08 02:54:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-08 02:54:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-08 02:54:55,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-04-08 02:54:55,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:55,345 INFO L225 Difference]: With dead ends: 406 [2022-04-08 02:54:55,345 INFO L226 Difference]: Without dead ends: 256 [2022-04-08 02:54:55,348 INFO L912 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-04-08 02:54:55,354 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:55,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-08 02:54:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2022-04-08 02:54:55,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:55,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,388 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,389 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,396 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2022-04-08 02:54:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2022-04-08 02:54:55,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:55,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:55,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-08 02:54:55,398 INFO L87 Difference]: Start difference. First operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-08 02:54:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,405 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2022-04-08 02:54:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2022-04-08 02:54:55,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:55,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:55,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:55,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 250 states have (on average 1.388) internal successors, (347), 250 states have internal predecessors, (347), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions. [2022-04-08 02:54:55,414 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 49 [2022-04-08 02:54:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:55,414 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions. [2022-04-08 02:54:55,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions. [2022-04-08 02:54:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 02:54:55,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:55,416 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:55,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 02:54:55,416 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash -346615166, now seen corresponding path program 1 times [2022-04-08 02:54:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241532015] [2022-04-08 02:54:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:55,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:55,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4622#true} is VALID [2022-04-08 02:54:55,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4622#true} {4622#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {4622#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:55,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {4628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4622#true} is VALID [2022-04-08 02:54:55,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {4622#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4622#true} {4622#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {4622#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {4622#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {4622#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {4622#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {4622#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {4622#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {4622#true} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {4622#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {4622#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {4622#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {4622#true} [222] L44-->L45: Formula: (= v_main_~s__state~0_15 8496) InVars {main_~s__state~0=v_main_~s__state~0_15} OutVars{main_~s__state~0=v_main_~s__state~0_15} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {4622#true} [225] L45-->L97-1: Formula: (and (= 2 v_main_~blastFlag~0_19) (= v_main_~blastFlag~0_20 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {4622#true} [229] L97-1-->L188: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_41 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_41, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {4622#true} is VALID [2022-04-08 02:54:55,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {4622#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {4622#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {4622#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {4622#true} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {4622#true} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {4622#true} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {4622#true} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {4622#true} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {4622#true} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {4622#true} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {4622#true} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {4622#true} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {4622#true} [266] L80-->L81: Formula: (= v_main_~s__state~0_36 8656) InVars {main_~s__state~0=v_main_~s__state~0_36} OutVars{main_~s__state~0=v_main_~s__state~0_36} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {4622#true} [270] L81-->L174-1: Formula: (and (= v_main_~blastFlag~0_8 3) (= v_main_~blastFlag~0_9 2)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_8} AuxVars[] AssignedVars[main_~blastFlag~0] {4622#true} is VALID [2022-04-08 02:54:55,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {4622#true} [274] L174-1-->L188: Formula: (= v_main_~s__state~0_23 8672) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_23} AuxVars[] AssignedVars[main_~s__state~0] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {4622#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {4622#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {4622#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {4622#true} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {4622#true} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {4622#true} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {4622#true} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {4622#true} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {4622#true} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {4622#true} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {4622#true} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {4622#true} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {4622#true} [267] L80-->L84: Formula: (not (= v_main_~s__state~0_37 8656)) InVars {main_~s__state~0=v_main_~s__state~0_37} OutVars{main_~s__state~0=v_main_~s__state~0_37} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {4622#true} [272] L84-->L85: Formula: (= v_main_~s__state~0_38 8672) InVars {main_~s__state~0=v_main_~s__state~0_38} OutVars{main_~s__state~0=v_main_~s__state~0_38} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {4622#true} [276] L85-->L184: Formula: (not (= v_main_~blastFlag~0_13 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_13} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {4622#true} [280] L184-->L181-1: Formula: (not (= 5 v_main_~blastFlag~0_15)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_15} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_15} AuxVars[] AssignedVars[] {4622#true} is VALID [2022-04-08 02:54:55,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {4622#true} [277] L181-1-->L188: Formula: (and (= v_main_~s__state~0_30 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_30, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {4627#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 02:54:55,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4627#(<= 8640 main_~s__state~0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4627#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 02:54:55,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {4627#(<= 8640 main_~s__state~0)} [213] L35-->L185: Formula: (and (< 2 v_main_~blastFlag~0_3) (<= v_main_~s__state~0_8 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3, main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {4623#false} is VALID [2022-04-08 02:54:55,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {4623#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4623#false} is VALID [2022-04-08 02:54:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 02:54:55,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:55,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241532015] [2022-04-08 02:54:55,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241532015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:55,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:55,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467765621] [2022-04-08 02:54:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 02:54:55,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:55,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:55,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:55,497 INFO L87 Difference]: Start difference. First operand 254 states and 350 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,746 INFO L93 Difference]: Finished difference Result 510 states and 719 transitions. [2022-04-08 02:54:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:55,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-08 02:54:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 02:54:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-08 02:54:55,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-08 02:54:55,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:55,868 INFO L225 Difference]: With dead ends: 510 [2022-04-08 02:54:55,868 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 02:54:55,869 INFO L912 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-04-08 02:54:55,869 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:55,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:54:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 02:54:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-08 02:54:55,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:55,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,890 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,891 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,894 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-08 02:54:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-08 02:54:55,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:55,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:55,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 02:54:55,896 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 186 states. [2022-04-08 02:54:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:55,899 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-08 02:54:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-08 02:54:55,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:55,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:55,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:55,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-08 02:54:55,903 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-08 02:54:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:55,904 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-08 02:54:55,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-08 02:54:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 02:54:55,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:54:55,905 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:55,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 02:54:55,906 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:54:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:54:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -987922748, now seen corresponding path program 1 times [2022-04-08 02:54:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:54:55,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093526470] [2022-04-08 02:54:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:54:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:54:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:54:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:54:55,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {5906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5900#true} is VALID [2022-04-08 02:54:55,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5900#true} {5900#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:54:55,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {5906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [205] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5900#true} is VALID [2022-04-08 02:54:55,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} [207] mainENTRY-->L188: Formula: (and (<= |v_main_#t~nondet7_2| 9223372036854775807) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~s__s3__tmp__new_cipher__algorithms~0_1 |v_main_#t~nondet7_2|) (= v_main_~s__state~0_2 8466) (= v_main_~s__session__peer~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet7_2| 9223372036854775808)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~s__verify_mode~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet7=|v_main_#t~nondet7_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~s__verify_mode~0=v_main_~s__verify_mode~0_1, main_~cb~0=v_main_~cb~0_1, main_~tmp___1~0=v_main_~tmp___1~0_1, main_~buf~0=v_main_~buf~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1, main_~s__session__peer~0=v_main_~s__session__peer~0_1, main_~s__state~0=v_main_~s__state~0_2, main_~s__s3__tmp__new_cipher__algorithms~0=v_main_~s__s3__tmp__new_cipher__algorithms~0_1, main_~s__hit~0=v_main_~s__hit~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~cb~0, main_#t~nondet4, main_~tmp___1~0, main_#t~nondet7, main_~buf~0, main_#t~nondet6, main_~blastFlag~0, main_~s__session__peer~0, main_~s__state~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~s__verify_mode~0, main_~s__hit~0] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5900#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5900#true} [218] L41-->L42: Formula: (= v_main_~s__state~0_12 8466) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {5900#true} [220] L42-->L90-1: Formula: (and (= v_main_~blastFlag~0_17 0) (= v_main_~blastFlag~0_16 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {5900#true} [224] L90-1-->L188: Formula: (= v_main_~s__state~0_40 8496) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_40} AuxVars[] AssignedVars[main_~s__state~0] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {5900#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {5900#true} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {5900#true} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {5900#true} [222] L44-->L45: Formula: (= v_main_~s__state~0_15 8496) InVars {main_~s__state~0=v_main_~s__state~0_15} OutVars{main_~s__state~0=v_main_~s__state~0_15} AuxVars[] AssignedVars[] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {5900#true} [225] L45-->L97-1: Formula: (and (= 2 v_main_~blastFlag~0_19) (= v_main_~blastFlag~0_20 1)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_20} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_19} AuxVars[] AssignedVars[main_~blastFlag~0] {5900#true} is VALID [2022-04-08 02:54:55,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {5900#true} [229] L97-1-->L188: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_41 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_41, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {5905#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {5905#(not (= main_~s__hit~0 0))} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {5905#(not (= main_~s__hit~0 0))} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {5905#(not (= main_~s__hit~0 0))} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {5905#(not (= main_~s__hit~0 0))} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {5905#(not (= main_~s__hit~0 0))} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {5905#(not (= main_~s__hit~0 0))} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {5905#(not (= main_~s__hit~0 0))} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {5905#(not (= main_~s__hit~0 0))} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {5905#(not (= main_~s__hit~0 0))} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {5905#(not (= main_~s__hit~0 0))} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {5905#(not (= main_~s__hit~0 0))} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {5905#(not (= main_~s__hit~0 0))} [266] L80-->L81: Formula: (= v_main_~s__state~0_36 8656) InVars {main_~s__state~0=v_main_~s__state~0_36} OutVars{main_~s__state~0=v_main_~s__state~0_36} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {5905#(not (= main_~s__hit~0 0))} [270] L81-->L174-1: Formula: (and (= v_main_~blastFlag~0_8 3) (= v_main_~blastFlag~0_9 2)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_8} AuxVars[] AssignedVars[main_~blastFlag~0] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {5905#(not (= main_~s__hit~0 0))} [274] L174-1-->L188: Formula: (= v_main_~s__state~0_23 8672) InVars {} OutVars{main_~s__state~0=v_main_~s__state~0_23} AuxVars[] AssignedVars[main_~s__state~0] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {5905#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {5905#(not (= main_~s__hit~0 0))} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:55,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {5905#(not (= main_~s__hit~0 0))} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {5905#(not (= main_~s__hit~0 0))} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {5905#(not (= main_~s__hit~0 0))} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {5905#(not (= main_~s__hit~0 0))} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {5905#(not (= main_~s__hit~0 0))} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {5905#(not (= main_~s__hit~0 0))} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {5905#(not (= main_~s__hit~0 0))} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {5905#(not (= main_~s__hit~0 0))} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {5905#(not (= main_~s__hit~0 0))} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {5905#(not (= main_~s__hit~0 0))} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {5905#(not (= main_~s__hit~0 0))} [267] L80-->L84: Formula: (not (= v_main_~s__state~0_37 8656)) InVars {main_~s__state~0=v_main_~s__state~0_37} OutVars{main_~s__state~0=v_main_~s__state~0_37} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {5905#(not (= main_~s__hit~0 0))} [272] L84-->L85: Formula: (= v_main_~s__state~0_38 8672) InVars {main_~s__state~0=v_main_~s__state~0_38} OutVars{main_~s__state~0=v_main_~s__state~0_38} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {5905#(not (= main_~s__hit~0 0))} [276] L85-->L184: Formula: (not (= v_main_~blastFlag~0_13 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_13} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {5905#(not (= main_~s__hit~0 0))} [280] L184-->L181-1: Formula: (not (= 5 v_main_~blastFlag~0_15)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_15} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_15} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {5905#(not (= main_~s__hit~0 0))} [277] L181-1-->L188: Formula: (and (= v_main_~s__state~0_30 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_30, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {5905#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {5905#(not (= main_~s__hit~0 0))} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {5905#(not (= main_~s__hit~0 0))} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {5905#(not (= main_~s__hit~0 0))} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {5905#(not (= main_~s__hit~0 0))} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {5905#(not (= main_~s__hit~0 0))} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {5905#(not (= main_~s__hit~0 0))} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {5905#(not (= main_~s__hit~0 0))} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {5905#(not (= main_~s__hit~0 0))} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {5905#(not (= main_~s__hit~0 0))} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {5905#(not (= main_~s__hit~0 0))} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {5905#(not (= main_~s__hit~0 0))} [262] L76-->L77: Formula: (= v_main_~s__state~0_34 8640) InVars {main_~s__state~0=v_main_~s__state~0_34} OutVars{main_~s__state~0=v_main_~s__state~0_34} AuxVars[] AssignedVars[] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {5905#(not (= main_~s__hit~0 0))} [264] L77-->L163-1: Formula: (and (= v_main_~blastFlag~0_6 3) (= v_main_~blastFlag~0_5 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_5} AuxVars[] AssignedVars[main_~blastFlag~0] {5905#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 02:54:56,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {5905#(not (= main_~s__hit~0 0))} [269] L163-1-->L188: Formula: (and (= v_main_~s__hit~0_3 0) (= v_main_~s__state~0_19 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_3} OutVars{main_~s__state~0=v_main_~s__state~0_19, main_~s__hit~0=v_main_~s__hit~0_3} AuxVars[] AssignedVars[main_~s__state~0] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {5901#false} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {5901#false} [214] L35-->L41: Formula: (or (not (< 2 v_main_~blastFlag~0_4)) (not (<= v_main_~s__state~0_10 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_4, main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {5901#false} [219] L41-->L44: Formula: (not (= v_main_~s__state~0_14 8466)) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {5901#false} [223] L44-->L48: Formula: (not (= v_main_~s__state~0_16 8496)) InVars {main_~s__state~0=v_main_~s__state~0_16} OutVars{main_~s__state~0=v_main_~s__state~0_16} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 67: Hoare triple {5901#false} [228] L48-->L52: Formula: (not (= v_main_~s__state~0_18 8512)) InVars {main_~s__state~0=v_main_~s__state~0_18} OutVars{main_~s__state~0=v_main_~s__state~0_18} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 68: Hoare triple {5901#false} [233] L52-->L56: Formula: (not (= v_main_~s__state~0_21 8528)) InVars {main_~s__state~0=v_main_~s__state~0_21} OutVars{main_~s__state~0=v_main_~s__state~0_21} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 69: Hoare triple {5901#false} [236] L56-->L60: Formula: (not (= v_main_~s__state~0_24 8544)) InVars {main_~s__state~0=v_main_~s__state~0_24} OutVars{main_~s__state~0=v_main_~s__state~0_24} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 70: Hoare triple {5901#false} [240] L60-->L64: Formula: (not (= v_main_~s__state~0_26 8560)) InVars {main_~s__state~0=v_main_~s__state~0_26} OutVars{main_~s__state~0=v_main_~s__state~0_26} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,009 INFO L290 TraceCheckUtils]: 71: Hoare triple {5901#false} [245] L64-->L68: Formula: (not (= v_main_~s__state~0_28 8576)) InVars {main_~s__state~0=v_main_~s__state~0_28} OutVars{main_~s__state~0=v_main_~s__state~0_28} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 72: Hoare triple {5901#false} [252] L68-->L72: Formula: (not (= v_main_~s__state~0_31 8592)) InVars {main_~s__state~0=v_main_~s__state~0_31} OutVars{main_~s__state~0=v_main_~s__state~0_31} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {5901#false} [260] L72-->L76: Formula: (not (= v_main_~s__state~0_33 8608)) InVars {main_~s__state~0=v_main_~s__state~0_33} OutVars{main_~s__state~0=v_main_~s__state~0_33} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 74: Hoare triple {5901#false} [263] L76-->L80: Formula: (not (= v_main_~s__state~0_35 8640)) InVars {main_~s__state~0=v_main_~s__state~0_35} OutVars{main_~s__state~0=v_main_~s__state~0_35} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 75: Hoare triple {5901#false} [267] L80-->L84: Formula: (not (= v_main_~s__state~0_37 8656)) InVars {main_~s__state~0=v_main_~s__state~0_37} OutVars{main_~s__state~0=v_main_~s__state~0_37} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 76: Hoare triple {5901#false} [272] L84-->L85: Formula: (= v_main_~s__state~0_38 8672) InVars {main_~s__state~0=v_main_~s__state~0_38} OutVars{main_~s__state~0=v_main_~s__state~0_38} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 77: Hoare triple {5901#false} [276] L85-->L184: Formula: (not (= v_main_~blastFlag~0_13 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_13} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 78: Hoare triple {5901#false} [279] L184-->L185: Formula: (= 5 v_main_~blastFlag~0_14) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_14} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,010 INFO L290 TraceCheckUtils]: 79: Hoare triple {5901#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5901#false} is VALID [2022-04-08 02:54:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 02:54:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:54:56,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093526470] [2022-04-08 02:54:56,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093526470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:54:56,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:54:56,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:54:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042290027] [2022-04-08 02:54:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:54:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 02:54:56,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:54:56,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:56,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:56,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:54:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:54:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:54:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:54:56,045 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:56,209 INFO L93 Difference]: Finished difference Result 299 states and 357 transitions. [2022-04-08 02:54:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:54:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 02:54:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:54:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 02:54:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 02:54:56,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 02:54:56,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:54:56,299 INFO L225 Difference]: With dead ends: 299 [2022-04-08 02:54:56,299 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 02:54:56,300 INFO L912 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-04-08 02:54:56,301 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:54:56,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:54:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 02:54:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 02:54:56,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:54:56,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 02:54:56,302 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 02:54:56,302 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 02:54:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:56,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:54:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:54:56,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:56,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:56,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-08 02:54:56,302 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-08 02:54:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:54:56,303 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 02:54:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:54:56,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:56,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:54:56,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:54:56,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:54:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 02:54:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 02:54:56,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-08 02:54:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:54:56,303 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 02:54:56,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:54:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 02:54:56,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:54:56,306 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 02:54:56,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 02:54:56,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 02:54:56,602 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 02:54:56,602 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 229) the Hoare annotation is: true [2022-04-08 02:54:56,602 INFO L878 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (and .cse0 (<= 8656 main_~s__state~0)) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-08 02:54:56,602 INFO L885 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 229) no Hoare annotation was computed. [2022-04-08 02:54:56,602 INFO L878 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 216) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 229) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L878 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 215) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L90-1(lines 90 92) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L878 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L48(lines 48 213) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L97-1(lines 86 195) no Hoare annotation was computed. [2022-04-08 02:54:56,603 INFO L878 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,603 INFO L882 garLoopResultBuilder]: For program point L52(lines 52 211) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L56(lines 56 209) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L60(lines 60 207) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 135) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L64(lines 64 205) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L118(lines 118 122) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L68(lines 68 203) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L882 garLoopResultBuilder]: For program point L126(lines 126 130) no Hoare annotation was computed. [2022-04-08 02:54:56,604 INFO L878 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L878 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L72(lines 72 201) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L878 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L76(lines 76 199) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L878 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L80(lines 80 197) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L163-1(lines 86 195) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L878 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and (= 3 main_~blastFlag~0) .cse0) (and (= main_~blastFlag~0 1) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 2 main_~blastFlag~0) .cse0))) [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L84(lines 84 195) no Hoare annotation was computed. [2022-04-08 02:54:56,605 INFO L882 garLoopResultBuilder]: For program point L174-1(lines 174 176) no Hoare annotation was computed. [2022-04-08 02:54:56,606 INFO L878 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and (= 3 main_~blastFlag~0) .cse0) (and (= main_~blastFlag~0 1) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 2 main_~blastFlag~0) .cse0))) [2022-04-08 02:54:56,606 INFO L882 garLoopResultBuilder]: For program point L181-1(lines 86 195) no Hoare annotation was computed. [2022-04-08 02:54:56,606 INFO L882 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-04-08 02:54:56,608 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:54:56,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 02:54:56,613 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:54:56,613 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 02:54:56,613 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 02:54:56,613 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:54:56,614 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 02:54:56,615 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 02:54:56,615 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:54:56,628 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-08 02:54:56,628 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 02:54:56,628 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 02:54:56,629 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-08 02:54:56,629 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-08 02:54:56,629 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 02:54:56,629 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-08 02:54:56,630 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-08 02:54:56,631 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-08 02:54:56,632 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-08 02:54:56,632 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-08 02:54:56,632 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-08 02:54:56,633 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-08 02:54:56,634 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 02:54:56,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:54:56 BasicIcfg [2022-04-08 02:54:56,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 02:54:56,658 INFO L158 Benchmark]: Toolchain (without parser) took 5150.66ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 150.6MB in the beginning and 221.2MB in the end (delta: -70.6MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,659 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 02:54:56,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.78ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 150.4MB in the beginning and 221.9MB in the end (delta: -71.5MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,659 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 251.7MB. Free memory was 221.9MB in the beginning and 220.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,660 INFO L158 Benchmark]: RCFGBuilder took 337.67ms. Allocated memory is still 251.7MB. Free memory was 220.3MB in the beginning and 205.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,660 INFO L158 Benchmark]: IcfgTransformer took 35.87ms. Allocated memory is still 251.7MB. Free memory was 204.6MB in the beginning and 202.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,660 INFO L158 Benchmark]: TraceAbstraction took 4488.50ms. Allocated memory is still 251.7MB. Free memory was 201.9MB in the beginning and 221.2MB in the end (delta: -19.2MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. [2022-04-08 02:54:56,661 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.78ms. Allocated memory was 178.3MB in the beginning and 251.7MB in the end (delta: 73.4MB). Free memory was 150.4MB in the beginning and 221.9MB in the end (delta: -71.5MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 251.7MB. Free memory was 221.9MB in the beginning and 220.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 337.67ms. Allocated memory is still 251.7MB. Free memory was 220.3MB in the beginning and 205.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 35.87ms. Allocated memory is still 251.7MB. Free memory was 204.6MB in the beginning and 202.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4488.50ms. Allocated memory is still 251.7MB. Free memory was 201.9MB in the beginning and 221.2MB in the end (delta: -19.2MB). Peak memory consumption was 127.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 - PositiveResult [Line: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 773 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 773 mSDsluCounter, 686 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 635 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 87 NumberOfFragments, 285 HoareAnnotationTreeSize, 21 FomulaSimplifications, 96 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 138 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 193/193 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((3 == blastFlag && 8656 <= s__state) || (blastFlag == 1 && 8656 <= s__state)) || (blastFlag == 0 && 8656 <= s__state)) || (2 == blastFlag && 8656 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((3 == blastFlag && 8656 <= s__state) || blastFlag == 0) || blastFlag == 1) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((3 == blastFlag && 8656 <= s__state) || (blastFlag == 1 && 8656 <= s__state)) || (blastFlag == 0 && 8656 <= s__state)) || (2 == blastFlag && 8656 <= s__state) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-04-08 02:54:56,704 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...