/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-14 23:26:14,115 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-14 23:26:14,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-14 23:26:14,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-14 23:26:14,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-14 23:26:14,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-14 23:26:14,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-14 23:26:14,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-14 23:26:14,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-14 23:26:14,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-14 23:26:14,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-14 23:26:14,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-14 23:26:14,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-14 23:26:14,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-14 23:26:14,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-14 23:26:14,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-14 23:26:14,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-14 23:26:14,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-14 23:26:14,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-14 23:26:14,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-14 23:26:14,158 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-14 23:26:14,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-14 23:26:14,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-14 23:26:14,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-14 23:26:14,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-14 23:26:14,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-14 23:26:14,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-14 23:26:14,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-14 23:26:14,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-14 23:26:14,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-14 23:26:14,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-14 23:26:14,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-14 23:26:14,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-14 23:26:14,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-14 23:26:14,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-14 23:26:14,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-14 23:26:14,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-14 23:26:14,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-14 23:26:14,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-14 23:26:14,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-14 23:26:14,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-14 23:26:14,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-14 23:26:14,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-14 23:26:14,181 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-14 23:26:14,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-14 23:26:14,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-14 23:26:14,183 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-14 23:26:14,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-14 23:26:14,183 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-14 23:26:14,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-14 23:26:14,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-14 23:26:14,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-14 23:26:14,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-14 23:26:14,184 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-14 23:26:14,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-14 23:26:14,185 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-14 23:26:14,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-14 23:26:14,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-14 23:26:14,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-14 23:26:14,185 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-14 23:26:14,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-14 23:26:14,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 23:26:14,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-14 23:26:14,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-14 23:26:14,187 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-14 23:26:14,187 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN
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-14 23:26:14,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-14 23:26:14,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-14 23:26:14,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-14 23:26:14,393 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-14 23:26:14,393 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-14 23:26:14,394 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-14 23:26:14,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca8dc291/8c73ef3763c7414f812fb905e811d42d/FLAGca0a26442
[2022-04-14 23:26:14,863 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-14 23:26:14,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c
[2022-04-14 23:26:14,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca8dc291/8c73ef3763c7414f812fb905e811d42d/FLAGca0a26442
[2022-04-14 23:26:14,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca8dc291/8c73ef3763c7414f812fb905e811d42d
[2022-04-14 23:26:14,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-14 23:26:14,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-14 23:26:14,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-14 23:26:14,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-14 23:26:14,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-14 23:26:14,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:26:14" (1/1) ...
[2022-04-14 23:26:14,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab4b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:14, skipping insertion in model container
[2022-04-14 23:26:14,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:26:14" (1/1) ...
[2022-04-14 23:26:14,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-14 23:26:14,942 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-14 23:26:15,125 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-14 23:26:15,129 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 23:26:15,141 INFO L203 MainTranslator]: Completed pre-run
[2022-04-14 23:26:15,177 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-14 23:26:15,178 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 23:26:15,197 INFO L208 MainTranslator]: Completed translation
[2022-04-14 23:26:15,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15 WrapperNode
[2022-04-14 23:26:15,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-14 23:26:15,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-14 23:26:15,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-14 23:26:15,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-14 23:26:15,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-14 23:26:15,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-14 23:26:15,246 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-14 23:26:15,246 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-14 23:26:15,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 23:26:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 23:26:15,276 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-14 23:26:15,282 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-14 23:26:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-14 23:26:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-14 23:26:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-14 23:26:15,322 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-14 23:26:15,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long
[2022-04-14 23:26:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-14 23:26:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-14 23:26:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-14 23:26:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-14 23:26:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-14 23:26:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-14 23:26:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-14 23:26:15,380 INFO L234 CfgBuilder]: Building ICFG
[2022-04-14 23:26:15,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-14 23:26:15,571 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-14 23:26:15,578 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-14 23:26:15,579 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-14 23:26:15,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:15 BoogieIcfgContainer
[2022-04-14 23:26:15,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-14 23:26:15,581 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-14 23:26:15,581 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-14 23:26:15,588 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-14 23:26:15,604 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:15" (1/1) ...
[2022-04-14 23:26:15,606 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-14 23:26:15,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:26:15 BasicIcfg
[2022-04-14 23:26:15,664 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-14 23:26:15,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-14 23:26:15,665 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-14 23:26:15,675 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-14 23:26:15,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:26:14" (1/4) ...
[2022-04-14 23:26:15,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bcb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:26:15, skipping insertion in model container
[2022-04-14 23:26:15,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:26:15" (2/4) ...
[2022-04-14 23:26:15,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bcb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:26:15, skipping insertion in model container
[2022-04-14 23:26:15,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:26:15" (3/4) ...
[2022-04-14 23:26:15,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bcb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:26:15, skipping insertion in model container
[2022-04-14 23:26:15,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 11:26:15" (4/4) ...
[2022-04-14 23:26:15,681 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.cJordan
[2022-04-14 23:26:15,686 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-14 23:26:15,686 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-14 23:26:15,736 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-14 23:26:15,746 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-14 23:26:15,746 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-14 23:26:15,772 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-14 23:26:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2022-04-14 23:26:15,781 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:15,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 23:26:15,783 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1676912857, now seen corresponding path program 1 times
[2022-04-14 23:26:15,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:15,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125907822]
[2022-04-14 23:26:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:16,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:16,072 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-14 23:26:16,073 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-14 23:26:16,073 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-14 23:26:16,076 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-14 23:26:16,077 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-14 23:26:16,077 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-14 23:26:16,077 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-14 23:26:16,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID
[2022-04-14 23:26:16,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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-14 23:26:16,080 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-14 23:26:16,081 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-14 23:26:16,082 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-14 23:26:16,083 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-14 23:26:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125907822]
[2022-04-14 23:26:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125907822] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:16,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:16,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145829219]
[2022-04-14 23:26:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:16,095 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-14 23:26:16,097 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:16,100 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-14 23:26:16,121 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-14 23:26:16,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:16,155 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-14 23:26:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:16,536 INFO L93 Difference]: Finished difference Result 91 states and 138 transitions.
[2022-04-14 23:26:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:16,536 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-14 23:26:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:16,538 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-14 23:26:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions.
[2022-04-14 23:26:16,548 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-14 23:26:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions.
[2022-04-14 23:26:16,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions.
[2022-04-14 23:26:16,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:16,701 INFO L225 Difference]: With dead ends: 91
[2022-04-14 23:26:16,702 INFO L226 Difference]: Without dead ends: 83
[2022-04-14 23:26:16,703 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-14 23:26:16,706 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-14 23:26:16,707 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-14 23:26:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2022-04-14 23:26:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2022-04-14 23:26:16,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:16,738 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-14 23:26:16,739 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-14 23:26:16,740 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-14 23:26:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:16,746 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions.
[2022-04-14 23:26:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions.
[2022-04-14 23:26:16,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:16,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:16,748 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-14 23:26:16,748 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-14 23:26:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:16,753 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions.
[2022-04-14 23:26:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions.
[2022-04-14 23:26:16,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:16,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:16,754 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:16,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:16,755 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-14 23:26:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions.
[2022-04-14 23:26:16,759 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9
[2022-04-14 23:26:16,759 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:16,760 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions.
[2022-04-14 23:26:16,760 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-14 23:26:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions.
[2022-04-14 23:26:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-14 23:26:16,761 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:16,761 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 23:26:16,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-14 23:26:16,761 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash 141831786, now seen corresponding path program 1 times
[2022-04-14 23:26:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:16,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552389362]
[2022-04-14 23:26:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:16,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#(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] {405#true} is VALID
[2022-04-14 23:26:16,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {405#true} {405#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:16,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#(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] {405#true} is VALID
[2022-04-14 23:26:16,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {405#true} is VALID
[2022-04-14 23:26:16,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID
[2022-04-14 23:26:16,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#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[] {405#true} is VALID
[2022-04-14 23:26:16,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {405#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[] {405#true} is VALID
[2022-04-14 23:26:16,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#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] {410#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:16,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {410#(= (+ (- 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] {410#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:16,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#(= (+ (- 1) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:16,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#(= (+ (- 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[] {406#false} is VALID
[2022-04-14 23:26:16,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#false} is VALID
[2022-04-14 23:26:16,815 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-14 23:26:16,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:16,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552389362]
[2022-04-14 23:26:16,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552389362] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:16,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:16,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325296721]
[2022-04-14 23:26:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:16,817 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-14 23:26:16,818 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:16,818 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-14 23:26:16,829 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-14 23:26:16,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:16,830 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-14 23:26:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,059 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions.
[2022-04-14 23:26:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:17,059 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-14 23:26:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:17,060 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-14 23:26:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2022-04-14 23:26:17,063 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-14 23:26:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2022-04-14 23:26:17,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions.
[2022-04-14 23:26:17,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:17,211 INFO L225 Difference]: With dead ends: 120
[2022-04-14 23:26:17,211 INFO L226 Difference]: Without dead ends: 120
[2022-04-14 23:26:17,212 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-14 23:26:17,213 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-14 23:26:17,213 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-14 23:26:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2022-04-14 23:26:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2022-04-14 23:26:17,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:17,221 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-14 23:26:17,221 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-14 23:26:17,222 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-14 23:26:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,227 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions.
[2022-04-14 23:26:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions.
[2022-04-14 23:26:17,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:17,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:17,229 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-14 23:26:17,230 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-14 23:26:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,258 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions.
[2022-04-14 23:26:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions.
[2022-04-14 23:26:17,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:17,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:17,259 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:17,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:17,260 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-14 23:26:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions.
[2022-04-14 23:26:17,264 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14
[2022-04-14 23:26:17,264 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:17,264 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions.
[2022-04-14 23:26:17,265 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-14 23:26:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions.
[2022-04-14 23:26:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-14 23:26:17,266 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:17,266 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 23:26:17,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-14 23:26:17,266 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1247550592, now seen corresponding path program 1 times
[2022-04-14 23:26:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374410711]
[2022-04-14 23:26:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:17,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {903#(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] {897#true} is VALID
[2022-04-14 23:26:17,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {897#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {897#true} {897#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {897#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:17,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#(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] {897#true} is VALID
[2022-04-14 23:26:17,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {897#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {897#true} {897#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {897#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {897#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {897#true} is VALID
[2022-04-14 23:26:17,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {897#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#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[] {897#true} is VALID
[2022-04-14 23:26:17,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#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[] {897#true} is VALID
[2022-04-14 23:26:17,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#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] {897#true} is VALID
[2022-04-14 23:26:17,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#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] {897#true} is VALID
[2022-04-14 23:26:17,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID
[2022-04-14 23:26:17,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#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[] {897#true} is VALID
[2022-04-14 23:26:17,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#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[] {897#true} is VALID
[2022-04-14 23:26:17,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#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[] {897#true} is VALID
[2022-04-14 23:26:17,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {897#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] {897#true} is VALID
[2022-04-14 23:26:17,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {897#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] {902#(<= 8656 main_~s__state~0)} is VALID
[2022-04-14 23:26:17,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#(<= 8656 main_~s__state~0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {902#(<= 8656 main_~s__state~0)} is VALID
[2022-04-14 23:26:17,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {902#(<= 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[] {898#false} is VALID
[2022-04-14 23:26:17,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {898#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {898#false} is VALID
[2022-04-14 23:26:17,324 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-14 23:26:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:17,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374410711]
[2022-04-14 23:26:17,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374410711] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:17,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:17,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249029195]
[2022-04-14 23:26:17,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:17,326 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-14 23:26:17,326 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:17,326 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-14 23:26:17,339 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-14 23:26:17,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:17,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:17,341 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-14 23:26:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,535 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions.
[2022-04-14 23:26:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:17,536 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-14 23:26:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:17,536 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-14 23:26:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions.
[2022-04-14 23:26:17,538 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-14 23:26:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions.
[2022-04-14 23:26:17,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions.
[2022-04-14 23:26:17,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:17,622 INFO L225 Difference]: With dead ends: 164
[2022-04-14 23:26:17,623 INFO L226 Difference]: Without dead ends: 164
[2022-04-14 23:26:17,623 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-14 23:26:17,630 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-14 23:26:17,632 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-14 23:26:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2022-04-14 23:26:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156.
[2022-04-14 23:26:17,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:17,647 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-14 23:26:17,647 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-14 23:26:17,648 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-14 23:26:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,653 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions.
[2022-04-14 23:26:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions.
[2022-04-14 23:26:17,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:17,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:17,655 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-14 23:26:17,660 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-14 23:26:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,668 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions.
[2022-04-14 23:26:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions.
[2022-04-14 23:26:17,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:17,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:17,672 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:17,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:17,673 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-14 23:26:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions.
[2022-04-14 23:26:17,679 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 20
[2022-04-14 23:26:17,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:17,680 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions.
[2022-04-14 23:26:17,680 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-14 23:26:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions.
[2022-04-14 23:26:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-14 23:26:17,682 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:17,682 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 23:26:17,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-14 23:26:17,682 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:17,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1247520801, now seen corresponding path program 1 times
[2022-04-14 23:26:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710814959]
[2022-04-14 23:26:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:17,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1563#(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] {1557#true} is VALID
[2022-04-14 23:26:17,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1557#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1557#true} {1557#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {1557#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:17,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1563#(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] {1557#true} is VALID
[2022-04-14 23:26:17,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1557#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1557#true} {1557#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1557#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1557#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {1557#true} is VALID
[2022-04-14 23:26:17,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {1557#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {1557#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[] {1557#true} is VALID
[2022-04-14 23:26:17,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#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[] {1557#true} is VALID
[2022-04-14 23:26:17,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1557#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] {1557#true} is VALID
[2022-04-14 23:26:17,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {1557#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] {1557#true} is VALID
[2022-04-14 23:26:17,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID
[2022-04-14 23:26:17,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#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[] {1557#true} is VALID
[2022-04-14 23:26:17,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#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[] {1557#true} is VALID
[2022-04-14 23:26:17,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {1557#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[] {1557#true} is VALID
[2022-04-14 23:26:17,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1557#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] {1562#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:17,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1562#(= (+ (- 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] {1562#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:17,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1562#(= (+ (- 2) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:17,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1562#(= (+ (- 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[] {1558#false} is VALID
[2022-04-14 23:26:17,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {1558#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1558#false} is VALID
[2022-04-14 23:26:17,739 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-14 23:26:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:17,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710814959]
[2022-04-14 23:26:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710814959] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:17,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:17,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017596806]
[2022-04-14 23:26:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:17,740 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-14 23:26:17,740 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:17,740 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-14 23:26:17,752 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-14 23:26:17,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:17,753 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-14 23:26:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:17,972 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions.
[2022-04-14 23:26:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:17,972 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-14 23:26:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:17,973 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-14 23:26:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions.
[2022-04-14 23:26:17,975 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-14 23:26:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions.
[2022-04-14 23:26:17,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions.
[2022-04-14 23:26:18,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:18,101 INFO L225 Difference]: With dead ends: 205
[2022-04-14 23:26:18,101 INFO L226 Difference]: Without dead ends: 205
[2022-04-14 23:26:18,102 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-14 23:26:18,103 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-14 23:26:18,103 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-14 23:26:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2022-04-14 23:26:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205.
[2022-04-14 23:26:18,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:18,110 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-14 23:26:18,111 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-14 23:26:18,111 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-14 23:26:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:18,123 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions.
[2022-04-14 23:26:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions.
[2022-04-14 23:26:18,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:18,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:18,125 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-14 23:26:18,125 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-14 23:26:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:18,142 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions.
[2022-04-14 23:26:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions.
[2022-04-14 23:26:18,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:18,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:18,143 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:18,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:18,143 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-14 23:26:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 282 transitions.
[2022-04-14 23:26:18,154 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 282 transitions. Word has length 20
[2022-04-14 23:26:18,154 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:18,154 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 282 transitions.
[2022-04-14 23:26:18,155 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-14 23:26:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions.
[2022-04-14 23:26:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2022-04-14 23:26:18,156 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:18,156 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-14 23:26:18,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-14 23:26:18,156 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1375802200, now seen corresponding path program 1 times
[2022-04-14 23:26:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:18,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766544184]
[2022-04-14 23:26:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:18,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {2395#(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] {2389#true} is VALID
[2022-04-14 23:26:18,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2389#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2389#true} {2389#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {2389#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:18,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {2395#(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] {2389#true} is VALID
[2022-04-14 23:26:18,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2389#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2389#true} {2389#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {2389#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {2389#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {2389#true} is VALID
[2022-04-14 23:26:18,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#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] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#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] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {2389#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] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {2389#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] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {2389#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[] {2389#true} is VALID
[2022-04-14 23:26:18,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {2389#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] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {2394#(= (+ (- 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] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {2394#(= (+ (- 3) main_~blastFlag~0) 0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {2394#(= (+ (- 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[] {2394#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID
[2022-04-14 23:26:18,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {2394#(= (+ (- 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[] {2390#false} is VALID
[2022-04-14 23:26:18,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {2390#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2390#false} is VALID
[2022-04-14 23:26:18,305 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-14 23:26:18,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:18,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766544184]
[2022-04-14 23:26:18,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766544184] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:18,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:18,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:18,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906117512]
[2022-04-14 23:26:18,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:18,306 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-14 23:26:18,306 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:18,307 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-14 23:26:18,335 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-14 23:26:18,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:18,336 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-14 23:26:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:18,535 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions.
[2022-04-14 23:26:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:18,536 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-14 23:26:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:18,536 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-14 23:26:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions.
[2022-04-14 23:26:18,538 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-14 23:26:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions.
[2022-04-14 23:26:18,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions.
[2022-04-14 23:26:18,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:18,660 INFO L225 Difference]: With dead ends: 256
[2022-04-14 23:26:18,661 INFO L226 Difference]: Without dead ends: 256
[2022-04-14 23:26:18,661 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-14 23:26:18,663 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-14 23:26:18,664 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-14 23:26:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2022-04-14 23:26:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254.
[2022-04-14 23:26:18,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:18,680 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-14 23:26:18,681 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-14 23:26:18,682 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-14 23:26:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:18,691 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions.
[2022-04-14 23:26:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions.
[2022-04-14 23:26:18,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:18,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:18,696 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-14 23:26:18,697 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-14 23:26:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:18,705 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions.
[2022-04-14 23:26:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions.
[2022-04-14 23:26:18,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:18,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:18,706 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:18,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:18,707 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-14 23:26:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions.
[2022-04-14 23:26:18,715 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 49
[2022-04-14 23:26:18,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:18,715 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions.
[2022-04-14 23:26:18,715 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-14 23:26:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions.
[2022-04-14 23:26:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2022-04-14 23:26:18,718 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:18,719 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-14 23:26:18,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-04-14 23:26:18,719 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -346615166, now seen corresponding path program 1 times
[2022-04-14 23:26:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051744356]
[2022-04-14 23:26:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:18,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#(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] {3423#true} is VALID
[2022-04-14 23:26:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3423#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3423#true} {3423#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {3423#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:18,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#(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] {3423#true} is VALID
[2022-04-14 23:26:18,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {3423#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3423#true} {3423#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {3423#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3423#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {3423#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] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {3423#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[] {3423#true} is VALID
[2022-04-14 23:26:18,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {3423#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] {3428#(<= 8640 main_~s__state~0)} is VALID
[2022-04-14 23:26:18,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {3428#(<= 8640 main_~s__state~0)} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3428#(<= 8640 main_~s__state~0)} is VALID
[2022-04-14 23:26:18,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {3428#(<= 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[] {3424#false} is VALID
[2022-04-14 23:26:18,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {3424#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3424#false} is VALID
[2022-04-14 23:26:18,816 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-14 23:26:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051744356]
[2022-04-14 23:26:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051744356] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:18,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:18,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719877166]
[2022-04-14 23:26:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:18,818 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-14 23:26:18,818 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:18,818 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-14 23:26:18,843 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-14 23:26:18,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:18,845 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-14 23:26:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,012 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions.
[2022-04-14 23:26:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:19,012 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-14 23:26:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:19,012 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-14 23:26:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2022-04-14 23:26:19,014 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-14 23:26:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2022-04-14 23:26:19,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions.
[2022-04-14 23:26:19,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:19,088 INFO L225 Difference]: With dead ends: 262
[2022-04-14 23:26:19,088 INFO L226 Difference]: Without dead ends: 186
[2022-04-14 23:26:19,088 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-14 23:26:19,089 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time
[2022-04-14 23:26:19,089 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.0s Time]
[2022-04-14 23:26:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2022-04-14 23:26:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183.
[2022-04-14 23:26:19,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:19,093 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-14 23:26:19,094 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-14 23:26:19,094 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-14 23:26:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,099 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions.
[2022-04-14 23:26:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions.
[2022-04-14 23:26:19,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:19,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:19,100 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-14 23:26:19,100 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-14 23:26:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,105 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions.
[2022-04-14 23:26:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions.
[2022-04-14 23:26:19,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:19,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:19,106 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:19,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:19,107 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-14 23:26:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions.
[2022-04-14 23:26:19,112 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52
[2022-04-14 23:26:19,112 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:19,112 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions.
[2022-04-14 23:26:19,112 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-14 23:26:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions.
[2022-04-14 23:26:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-04-14 23:26:19,113 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 23:26:19,113 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-14 23:26:19,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-04-14 23:26:19,113 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 23:26:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 23:26:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash -987922748, now seen corresponding path program 1 times
[2022-04-14 23:26:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 23:26:19,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416940394]
[2022-04-14 23:26:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 23:26:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 23:26:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 23:26:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 23:26:19,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {4258#(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] {4252#true} is VALID
[2022-04-14 23:26:19,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {4252#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4252#true} {4252#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {4252#true} [203] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 23:26:19,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {4258#(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] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {4252#true} [208] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4252#true} {4252#true} [281] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {4252#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {4252#true} [207] mainENTRY-->L188: Formula: (and (= |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)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= 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] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {4252#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {4252#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[] {4252#true} is VALID
[2022-04-14 23:26:19,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {4252#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[] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {4252#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] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {4252#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] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {4252#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {4252#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[] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {4252#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[] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {4252#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[] {4252#true} is VALID
[2022-04-14 23:26:19,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {4252#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] {4252#true} is VALID
[2022-04-14 23:26:19,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#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] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {4257#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {4257#(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] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {4257#(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] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {4257#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {4257#(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] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {4257#(not (= main_~s__hit~0 0))} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {4257#(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[] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {4257#(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] {4257#(not (= main_~s__hit~0 0))} is VALID
[2022-04-14 23:26:19,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {4257#(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] {4253#false} is VALID
[2022-04-14 23:26:19,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {4253#false} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 76: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 77: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {4253#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[] {4253#false} is VALID
[2022-04-14 23:26:19,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {4253#false} [216] L185-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4253#false} is VALID
[2022-04-14 23:26:19,198 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-14 23:26:19,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 23:26:19,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416940394]
[2022-04-14 23:26:19,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416940394] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 23:26:19,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 23:26:19,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-14 23:26:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889785669]
[2022-04-14 23:26:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 23:26:19,199 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-14 23:26:19,199 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 23:26:19,199 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-14 23:26:19,233 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-14 23:26:19,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-14 23:26:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 23:26:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-14 23:26:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-14 23:26:19,234 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-14 23:26:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,363 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions.
[2022-04-14 23:26:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-14 23:26:19,363 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-14 23:26:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 23:26:19,364 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-14 23:26:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2022-04-14 23:26:19,365 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-14 23:26:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2022-04-14 23:26:19,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions.
[2022-04-14 23:26:19,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 23:26:19,435 INFO L225 Difference]: With dead ends: 200
[2022-04-14 23:26:19,435 INFO L226 Difference]: Without dead ends: 0
[2022-04-14 23:26:19,435 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-14 23:26:19,436 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-14 23:26:19,436 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-14 23:26:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-14 23:26:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-14 23:26:19,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 23:26:19,437 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-14 23:26:19,437 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-14 23:26:19,437 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-14 23:26:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,437 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 23:26:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 23:26:19,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:19,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:19,438 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-14 23:26:19,438 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-14 23:26:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 23:26:19,438 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 23:26:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 23:26:19,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:19,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 23:26:19,438 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 23:26:19,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 23:26:19,438 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-14 23:26:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-14 23:26:19,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80
[2022-04-14 23:26:19,438 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 23:26:19,439 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-14 23:26:19,439 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-14 23:26:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 23:26:19,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 23:26:19,441 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-14 23:26:19,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-04-14 23:26:19,445 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2022-04-14 23:26:19,446 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-14 23:26:19,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:26:19 BasicIcfg
[2022-04-14 23:26:19,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-14 23:26:19,449 INFO L158 Benchmark]: Toolchain (without parser) took 4565.75ms. Allocated memory was 190.8MB in the beginning and 271.6MB in the end (delta: 80.7MB). Free memory was 132.8MB in the beginning and 176.1MB in the end (delta: -43.2MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,450 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 23:26:19,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.04ms. Allocated memory was 190.8MB in the beginning and 271.6MB in the end (delta: 80.7MB). Free memory was 164.0MB in the beginning and 240.9MB in the end (delta: -76.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,450 INFO L158 Benchmark]: Boogie Preprocessor took 45.38ms. Allocated memory is still 271.6MB. Free memory was 240.9MB in the beginning and 239.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,450 INFO L158 Benchmark]: RCFGBuilder took 334.34ms. Allocated memory is still 271.6MB. Free memory was 239.3MB in the beginning and 224.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,451 INFO L158 Benchmark]: IcfgTransformer took 82.72ms. Allocated memory is still 271.6MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,451 INFO L158 Benchmark]: TraceAbstraction took 3783.45ms. Allocated memory is still 271.6MB. Free memory was 221.5MB in the beginning and 176.1MB in the end (delta: 45.4MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB.
[2022-04-14 23:26:19,452 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.15ms. Allocated memory is still 190.8MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 294.04ms. Allocated memory was 190.8MB in the beginning and 271.6MB in the end (delta: 80.7MB). Free memory was 164.0MB in the beginning and 240.9MB in the end (delta: -76.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 45.38ms. Allocated memory is still 271.6MB. Free memory was 240.9MB in the beginning and 239.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 334.34ms. Allocated memory is still 271.6MB. Free memory was 239.3MB in the beginning and 224.1MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB.
* IcfgTransformer took 82.72ms. Allocated memory is still 271.6MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* TraceAbstraction took 3783.45ms. Allocated memory is still 271.6MB. Free memory was 221.5MB in the beginning and 176.1MB in the end (delta: 45.4MB). Peak memory consumption was 46.5MB. 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: 3.7s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, 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: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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
RESULT: Ultimate proved your program to be correct!
[2022-04-14 23:26:19,482 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...