/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-34549b5 [2022-04-07 21:18:10,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:18:10,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:18:10,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:18:10,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:18:10,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:18:10,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:18:10,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:18:10,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:18:10,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:18:10,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:18:10,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:18:10,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:18:10,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:18:10,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:18:10,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:18:10,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:18:10,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:18:10,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:18:10,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:18:10,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:18:10,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:18:10,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:18:10,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:18:10,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:18:10,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:18:10,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:18:10,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:18:10,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:18:10,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:18:10,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:18:10,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:18:10,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:18:10,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:18:10,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:18:10,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:18:10,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:18:10,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:18:10,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:18:10,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:18:10,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:18:10,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:18:10,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 21:18:10,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:18:10,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:18:10,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:18:10,157 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 21:18:10,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:18:10,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 21:18:10,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:18:10,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:18:10,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:18:10,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:18:10,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:18:10,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 21:18:10,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:18:10,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:18:10,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:18:10,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:18:10,162 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:18:10,162 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-07 21:18:10,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:18:10,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:18:10,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:18:10,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:18:10,457 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:18:10,458 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-07 21:18:10,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b8c0c5/6286beb3f8024e4ca2fe075ebc14c558/FLAG321277015 [2022-04-07 21:18:10,951 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:18:10,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-07 21:18:10,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b8c0c5/6286beb3f8024e4ca2fe075ebc14c558/FLAG321277015 [2022-04-07 21:18:11,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612b8c0c5/6286beb3f8024e4ca2fe075ebc14c558 [2022-04-07 21:18:11,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:18:11,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:18:11,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:18:11,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:18:11,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:18:11,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c717bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11, skipping insertion in model container [2022-04-07 21:18:11,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:18:11,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:18:11,590 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-07 21:18:11,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:18:11,628 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:18:11,665 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-07 21:18:11,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:18:11,678 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:18:11,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11 WrapperNode [2022-04-07 21:18:11,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:18:11,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:18:11,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:18:11,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:18:11,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:18:11,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:18:11,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:18:11,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:18:11,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (1/1) ... [2022-04-07 21:18:11,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:18:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:18:11,761 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-07 21:18:11,786 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-07 21:18:11,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:18:11,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:18:11,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:18:11,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:18:11,808 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 21:18:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 21:18:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:18:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:18:11,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:18:11,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:18:11,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:18:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:18:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:18:11,875 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:18:11,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:18:12,086 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:18:12,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:18:12,092 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:18:12,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:18:12 BoogieIcfgContainer [2022-04-07 21:18:12,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:18:12,095 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:18:12,095 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:18:12,096 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:18:12,098 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:18:12" (1/1) ... [2022-04-07 21:18:12,100 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 21:18:12,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:18:12 BasicIcfg [2022-04-07 21:18:12,133 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:18:12,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:18:12,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:18:12,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:18:12,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:18:11" (1/4) ... [2022-04-07 21:18:12,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5159d2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:18:12, skipping insertion in model container [2022-04-07 21:18:12,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:18:11" (2/4) ... [2022-04-07 21:18:12,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5159d2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:18:12, skipping insertion in model container [2022-04-07 21:18:12,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:18:12" (3/4) ... [2022-04-07 21:18:12,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5159d2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:18:12, skipping insertion in model container [2022-04-07 21:18:12,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:18:12" (4/4) ... [2022-04-07 21:18:12,140 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.cJordan [2022-04-07 21:18:12,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:18:12,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:18:12,199 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:18:12,205 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-07 21:18:12,205 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:18:12,245 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-07 21:18:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-07 21:18:12,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:12,253 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:18:12,253 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1676912857, now seen corresponding path program 1 times [2022-04-07 21:18:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:12,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674464257] [2022-04-07 21:18:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:12,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:12,536 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-07 21:18:12,537 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-07 21:18:12,537 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-07 21:18:12,543 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-07 21:18:12,544 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-07 21:18:12,544 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-07 21:18:12,545 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-07 21:18:12,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#true} is VALID [2022-04-07 21:18:12,547 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-07 21:18:12,548 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-07 21:18:12,552 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-07 21:18:12,554 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-07 21:18:12,554 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-07 21:18:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:12,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674464257] [2022-04-07 21:18:12,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674464257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:12,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:12,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425153949] [2022-04-07 21:18:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:12,567 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-07 21:18:12,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:12,572 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-07 21:18:12,602 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-07 21:18:12,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:12,636 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-07 21:18:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,078 INFO L93 Difference]: Finished difference Result 91 states and 138 transitions. [2022-04-07 21:18:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:13,078 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-07 21:18:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:13,080 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-07 21:18:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-07 21:18:13,096 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-07 21:18:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-07 21:18:13,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-07 21:18:13,263 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-07 21:18:13,279 INFO L225 Difference]: With dead ends: 91 [2022-04-07 21:18:13,279 INFO L226 Difference]: Without dead ends: 83 [2022-04-07 21:18:13,281 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-07 21:18:13,285 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-07 21:18:13,286 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-07 21:18:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-07 21:18:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-07 21:18:13,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:13,321 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-07 21:18:13,322 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-07 21:18:13,323 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-07 21:18:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,335 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-07 21:18:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-07 21:18:13,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:13,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:13,340 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-07 21:18:13,341 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-07 21:18:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,351 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-07 21:18:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-07 21:18:13,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:13,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:13,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:13,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:13,353 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-07 21:18:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-07 21:18:13,357 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-07 21:18:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:13,358 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-07 21:18:13,358 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-07 21:18:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-07 21:18:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 21:18:13,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:13,359 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:18:13,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:18:13,360 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 141831786, now seen corresponding path program 1 times [2022-04-07 21:18:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:13,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404072487] [2022-04-07 21:18:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:13,422 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-07 21:18:13,422 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-07 21:18:13,422 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-07 21:18:13,423 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-07 21:18:13,423 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-07 21:18:13,424 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-07 21:18:13,424 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-07 21:18:13,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-07 21:18:13,424 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-07 21:18:13,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-07 21:18:13,425 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-07 21:18:13,425 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-07 21:18:13,426 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-07 21:18:13,426 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-07 21:18:13,427 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-07 21:18:13,427 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-07 21:18:13,427 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-07 21:18:13,428 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-07 21:18:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:13,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404072487] [2022-04-07 21:18:13,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404072487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:13,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:13,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262518695] [2022-04-07 21:18:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:13,430 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-07 21:18:13,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:13,431 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-07 21:18:13,446 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-07 21:18:13,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:13,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:13,447 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-07 21:18:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,711 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-07 21:18:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:13,711 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-07 21:18:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:13,712 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-07 21:18:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-07 21:18:13,715 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-07 21:18:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-07 21:18:13,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-07 21:18:13,869 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-07 21:18:13,872 INFO L225 Difference]: With dead ends: 120 [2022-04-07 21:18:13,872 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 21:18:13,873 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-07 21:18:13,874 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-07 21:18:13,874 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-07 21:18:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 21:18:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 21:18:13,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:13,891 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-07 21:18:13,891 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-07 21:18:13,892 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-07 21:18:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,900 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-07 21:18:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-07 21:18:13,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:13,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:13,907 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-07 21:18:13,908 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-07 21:18:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:13,913 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-07 21:18:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-07 21:18:13,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:13,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:13,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:13,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:13,915 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-07 21:18:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-07 21:18:13,919 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-07 21:18:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:13,920 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-07 21:18:13,920 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-07 21:18:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-07 21:18:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:18:13,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:13,921 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:18:13,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:18:13,921 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1247550592, now seen corresponding path program 1 times [2022-04-07 21:18:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:13,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331344448] [2022-04-07 21:18:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:13,974 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-07 21:18:13,974 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-07 21:18:13,974 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-07 21:18:13,975 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-07 21:18:13,975 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-07 21:18:13,976 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-07 21:18:13,976 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-07 21:18:13,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {897#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID [2022-04-07 21:18:13,976 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-07 21:18:13,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {897#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID [2022-04-07 21:18:13,977 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-07 21:18:13,977 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-07 21:18:13,977 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-07 21:18:13,977 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-07 21:18:13,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {897#true} is VALID [2022-04-07 21:18:13,978 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-07 21:18:13,978 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-07 21:18:13,978 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-07 21:18:13,978 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-07 21:18:13,979 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-07 21:18:13,984 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-07 21:18:13,984 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-07 21:18:13,985 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-07 21:18:13,985 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-07 21:18:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:13,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331344448] [2022-04-07 21:18:13,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331344448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:13,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:13,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883234227] [2022-04-07 21:18:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:13,987 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-07 21:18:13,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:13,987 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-07 21:18:14,000 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-07 21:18:14,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:14,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:14,001 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-07 21:18:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,192 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2022-04-07 21:18:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:14,193 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-07 21:18:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:14,193 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-07 21:18:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-07 21:18:14,196 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-07 21:18:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-07 21:18:14,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-07 21:18:14,280 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-07 21:18:14,288 INFO L225 Difference]: With dead ends: 164 [2022-04-07 21:18:14,288 INFO L226 Difference]: Without dead ends: 164 [2022-04-07 21:18:14,289 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-07 21:18:14,298 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-07 21:18:14,300 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-07 21:18:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-07 21:18:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2022-04-07 21:18:14,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:14,315 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-07 21:18:14,315 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-07 21:18:14,316 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-07 21:18:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,326 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2022-04-07 21:18:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2022-04-07 21:18:14,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:14,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:14,328 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-07 21:18:14,329 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-07 21:18:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,336 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2022-04-07 21:18:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 225 transitions. [2022-04-07 21:18:14,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:14,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:14,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:14,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:14,339 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-07 21:18:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2022-04-07 21:18:14,345 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 20 [2022-04-07 21:18:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:14,346 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-04-07 21:18:14,346 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-07 21:18:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-04-07 21:18:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 21:18:14,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:14,347 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:18:14,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:18:14,347 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:14,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1247520801, now seen corresponding path program 1 times [2022-04-07 21:18:14,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669820078] [2022-04-07 21:18:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:14,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:14,424 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-07 21:18:14,424 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-07 21:18:14,425 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-07 21:18:14,426 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-07 21:18:14,440 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-07 21:18:14,440 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-07 21:18:14,440 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-07 21:18:14,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {1557#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID [2022-04-07 21:18:14,441 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-07 21:18:14,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {1557#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID [2022-04-07 21:18:14,441 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-07 21:18:14,441 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-07 21:18:14,442 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-07 21:18:14,442 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-07 21:18:14,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1557#true} is VALID [2022-04-07 21:18:14,442 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-07 21:18:14,443 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-07 21:18:14,443 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-07 21:18:14,444 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-07 21:18:14,445 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-07 21:18:14,445 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-07 21:18:14,446 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-07 21:18:14,446 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-07 21:18:14,446 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-07 21:18:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669820078] [2022-04-07 21:18:14,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669820078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:14,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:14,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948749486] [2022-04-07 21:18:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:14,448 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-07 21:18:14,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:14,448 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-07 21:18:14,463 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-07 21:18:14,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:14,464 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-07 21:18:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,674 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions. [2022-04-07 21:18:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:14,674 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-07 21:18:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:14,676 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-07 21:18:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-07 21:18:14,678 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-07 21:18:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-07 21:18:14,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-07 21:18:14,816 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-07 21:18:14,820 INFO L225 Difference]: With dead ends: 205 [2022-04-07 21:18:14,820 INFO L226 Difference]: Without dead ends: 205 [2022-04-07 21:18:14,820 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-07 21:18:14,821 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-07 21:18:14,822 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-07 21:18:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-07 21:18:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-04-07 21:18:14,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:14,830 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-07 21:18:14,830 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-07 21:18:14,831 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-07 21:18:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,838 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions. [2022-04-07 21:18:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-07 21:18:14,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:14,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:14,840 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-07 21:18:14,840 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-07 21:18:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:14,847 INFO L93 Difference]: Finished difference Result 205 states and 282 transitions. [2022-04-07 21:18:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-07 21:18:14,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:14,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:14,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:14,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:14,849 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-07 21:18:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 282 transitions. [2022-04-07 21:18:14,855 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 282 transitions. Word has length 20 [2022-04-07 21:18:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:14,855 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 282 transitions. [2022-04-07 21:18:14,855 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-07 21:18:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2022-04-07 21:18:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 21:18:14,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:14,857 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-07 21:18:14,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 21:18:14,857 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1375802200, now seen corresponding path program 1 times [2022-04-07 21:18:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:14,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159418306] [2022-04-07 21:18:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:14,924 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-07 21:18:14,924 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-07 21:18:14,924 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-07 21:18:14,925 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-07 21:18:14,925 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-07 21:18:14,926 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-07 21:18:14,926 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-07 21:18:14,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {2389#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID [2022-04-07 21:18:14,926 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-07 21:18:14,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID [2022-04-07 21:18:14,927 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-07 21:18:14,927 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-07 21:18:14,927 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-07 21:18:14,927 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-07 21:18:14,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID [2022-04-07 21:18:14,927 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-07 21:18:14,928 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-07 21:18:14,928 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-07 21:18:14,928 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-07 21:18:14,928 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-07 21:18:14,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {2389#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#true} is VALID [2022-04-07 21:18:14,929 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-07 21:18:14,929 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-07 21:18:14,929 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-07 21:18:14,929 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-07 21:18:14,929 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-07 21:18:14,929 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-07 21:18:14,930 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-07 21:18:14,930 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-07 21:18:14,930 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-07 21:18:14,930 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-07 21:18:14,930 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-07 21:18:14,931 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-07 21:18:14,931 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-07 21:18:14,932 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-07 21:18:14,932 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-07 21:18:14,932 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-07 21:18:14,933 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-07 21:18:14,933 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-07 21:18:14,934 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-07 21:18:14,934 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-07 21:18:14,934 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-07 21:18:14,935 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-07 21:18:14,935 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-07 21:18:14,936 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-07 21:18:14,936 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-07 21:18:14,937 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-07 21:18:14,937 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-07 21:18:14,937 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-07 21:18:14,938 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-07 21:18:14,938 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-07 21:18:14,938 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-07 21:18:14,939 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-07 21:18:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:14,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159418306] [2022-04-07 21:18:14,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159418306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:14,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:14,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818796008] [2022-04-07 21:18:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:14,940 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-07 21:18:14,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:14,941 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-07 21:18:14,973 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-07 21:18:14,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:14,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:14,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:14,975 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-07 21:18:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,193 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2022-04-07 21:18:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:15,194 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-07 21:18:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:15,194 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-07 21:18:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-07 21:18:15,196 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-07 21:18:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-07 21:18:15,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-07 21:18:15,313 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-07 21:18:15,317 INFO L225 Difference]: With dead ends: 256 [2022-04-07 21:18:15,318 INFO L226 Difference]: Without dead ends: 256 [2022-04-07 21:18:15,318 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-07 21:18:15,319 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-07 21:18:15,319 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-07 21:18:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-07 21:18:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2022-04-07 21:18:15,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:15,327 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-07 21:18:15,327 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-07 21:18:15,328 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-07 21:18:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,335 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2022-04-07 21:18:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2022-04-07 21:18:15,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:15,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:15,337 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-07 21:18:15,338 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-07 21:18:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,345 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2022-04-07 21:18:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2022-04-07 21:18:15,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:15,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:15,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:15,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:15,347 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-07 21:18:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions. [2022-04-07 21:18:15,354 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 49 [2022-04-07 21:18:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:15,354 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions. [2022-04-07 21:18:15,354 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-07 21:18:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions. [2022-04-07 21:18:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-07 21:18:15,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:15,356 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-07 21:18:15,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 21:18:15,356 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash -346615166, now seen corresponding path program 1 times [2022-04-07 21:18:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912779481] [2022-04-07 21:18:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:15,410 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-07 21:18:15,410 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-07 21:18:15,410 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-07 21:18:15,411 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-07 21:18:15,411 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-07 21:18:15,411 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-07 21:18:15,411 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-07 21:18:15,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {3423#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID [2022-04-07 21:18:15,412 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-07 21:18:15,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID [2022-04-07 21:18:15,412 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-07 21:18:15,412 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-07 21:18:15,413 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-07 21:18:15,413 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-07 21:18:15,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID [2022-04-07 21:18:15,413 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-07 21:18:15,413 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-07 21:18:15,413 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-07 21:18:15,414 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-07 21:18:15,414 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-07 21:18:15,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID [2022-04-07 21:18:15,414 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-07 21:18:15,414 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-07 21:18:15,415 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-07 21:18:15,415 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-07 21:18:15,415 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-07 21:18:15,415 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-07 21:18:15,415 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-07 21:18:15,415 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-07 21:18:15,416 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-07 21:18:15,416 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-07 21:18:15,416 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-07 21:18:15,416 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-07 21:18:15,416 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-07 21:18:15,416 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-07 21:18:15,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {3423#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3423#true} is VALID [2022-04-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,417 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,418 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-07 21:18:15,419 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-07 21:18:15,419 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-07 21:18:15,420 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-07 21:18:15,420 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-07 21:18:15,420 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-07 21:18:15,421 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-07 21:18:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:15,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912779481] [2022-04-07 21:18:15,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912779481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:15,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:15,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767854627] [2022-04-07 21:18:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:15,422 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-07 21:18:15,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:15,422 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-07 21:18:15,443 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-07 21:18:15,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:15,445 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-07 21:18:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,635 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions. [2022-04-07 21:18:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:15,635 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-07 21:18:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:15,636 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-07 21:18:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-07 21:18:15,637 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-07 21:18:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-07 21:18:15,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-07 21:18:15,726 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-07 21:18:15,729 INFO L225 Difference]: With dead ends: 262 [2022-04-07 21:18:15,729 INFO L226 Difference]: Without dead ends: 186 [2022-04-07 21:18:15,729 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-07 21:18:15,730 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 21:18:15,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 21:18:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-07 21:18:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-07 21:18:15,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:15,737 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-07 21:18:15,737 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-07 21:18:15,738 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-07 21:18:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,755 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-07 21:18:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-07 21:18:15,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:15,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:15,756 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-07 21:18:15,756 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-07 21:18:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:15,762 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-07 21:18:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-07 21:18:15,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:15,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:15,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:15,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:15,775 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-07 21:18:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-07 21:18:15,779 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-07 21:18:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:15,779 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-07 21:18:15,779 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-07 21:18:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-07 21:18:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-07 21:18:15,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:18:15,780 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-07 21:18:15,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 21:18:15,781 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:18:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:18:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -987922748, now seen corresponding path program 1 times [2022-04-07 21:18:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:18:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360245711] [2022-04-07 21:18:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:18:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:18:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:18:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:18:15,893 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-07 21:18:15,893 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-07 21:18:15,894 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-07 21:18:15,894 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-07 21:18:15,894 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-07 21:18:15,894 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-07 21:18:15,895 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-07 21:18:15,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {4252#true} [204] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID [2022-04-07 21:18:15,895 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-07 21:18:15,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {4252#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID [2022-04-07 21:18:15,895 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-07 21:18:15,895 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-07 21:18:15,895 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-07 21:18:15,896 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-07 21:18:15,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {4252#true} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4252#true} is VALID [2022-04-07 21:18:15,896 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-07 21:18:15,896 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-07 21:18:15,896 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-07 21:18:15,896 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-07 21:18:15,897 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-07 21:18:15,897 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-07 21:18:15,897 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-07 21:18:15,898 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-07 21:18:15,898 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-07 21:18:15,898 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-07 21:18:15,899 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-07 21:18:15,899 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-07 21:18:15,900 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-07 21:18:15,900 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-07 21:18:15,900 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-07 21:18:15,901 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-07 21:18:15,901 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-07 21:18:15,902 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-07 21:18:15,902 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-07 21:18:15,902 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-07 21:18:15,903 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-07 21:18:15,903 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-07 21:18:15,903 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-07 21:18:15,904 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-07 21:18:15,904 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-07 21:18:15,904 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-07 21:18:15,905 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-07 21:18:15,905 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-07 21:18:15,905 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-07 21:18:15,906 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-07 21:18:15,906 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-07 21:18:15,906 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-07 21:18:15,907 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-07 21:18:15,907 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-07 21:18:15,907 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-07 21:18:15,908 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-07 21:18:15,908 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-07 21:18:15,909 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-07 21:18:15,909 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-07 21:18:15,909 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-07 21:18:15,910 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-07 21:18:15,910 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-07 21:18:15,910 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-07 21:18:15,911 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-07 21:18:15,911 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-07 21:18:15,911 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-07 21:18:15,912 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-07 21:18:15,912 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-07 21:18:15,912 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-07 21:18:15,913 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-07 21:18:15,913 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-07 21:18:15,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {4253#false} [211] L188-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4253#false} is VALID [2022-04-07 21:18:15,913 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,914 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,915 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-07 21:18:15,916 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-07 21:18:15,916 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-07 21:18:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:18:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360245711] [2022-04-07 21:18:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360245711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:18:15,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:18:15,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:18:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149918783] [2022-04-07 21:18:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:18:15,918 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-07 21:18:15,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:18:15,918 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-07 21:18:15,951 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-07 21:18:15,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:18:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:18:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:18:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:18:15,952 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-07 21:18:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:16,104 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2022-04-07 21:18:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 21:18:16,105 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-07 21:18:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:18:16,105 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-07 21:18:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:18:16,107 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-07 21:18:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-04-07 21:18:16,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2022-04-07 21:18:16,183 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-07 21:18:16,184 INFO L225 Difference]: With dead ends: 200 [2022-04-07 21:18:16,184 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 21:18:16,184 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-07 21:18:16,185 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-07 21:18:16,185 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-07 21:18:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 21:18:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 21:18:16,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:18:16,186 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-07 21:18:16,186 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-07 21:18:16,186 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-07 21:18:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:16,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:18:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:18:16,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:16,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:16,187 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-07 21:18:16,187 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-07 21:18:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:18:16,187 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 21:18:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:18:16,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:16,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:18:16,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:18:16,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:18:16,188 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-07 21:18:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 21:18:16,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-07 21:18:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:18:16,188 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 21:18:16,188 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-07 21:18:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 21:18:16,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:18:16,191 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 21:18:16,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 21:18:16,194 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:18:16,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 21:18:16,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:18:16 BasicIcfg [2022-04-07 21:18:16,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 21:18:16,199 INFO L158 Benchmark]: Toolchain (without parser) took 4850.89ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 139.0MB in the beginning and 164.5MB in the end (delta: -25.4MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,199 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 190.8MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 21:18:16,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.23ms. Allocated memory is still 190.8MB. Free memory was 138.8MB in the beginning and 165.5MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,200 INFO L158 Benchmark]: Boogie Preprocessor took 42.56ms. Allocated memory is still 190.8MB. Free memory was 165.5MB in the beginning and 163.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,200 INFO L158 Benchmark]: RCFGBuilder took 371.19ms. Allocated memory is still 190.8MB. Free memory was 163.8MB in the beginning and 149.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,200 INFO L158 Benchmark]: IcfgTransformer took 38.21ms. Allocated memory is still 190.8MB. Free memory was 149.7MB in the beginning and 147.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,201 INFO L158 Benchmark]: TraceAbstraction took 4064.10ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 147.0MB in the beginning and 164.5MB in the end (delta: -17.5MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2022-04-07 21:18:16,202 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.14ms. Allocated memory is still 190.8MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.23ms. Allocated memory is still 190.8MB. Free memory was 138.8MB in the beginning and 165.5MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.56ms. Allocated memory is still 190.8MB. Free memory was 165.5MB in the beginning and 163.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.19ms. Allocated memory is still 190.8MB. Free memory was 163.8MB in the beginning and 149.7MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 38.21ms. Allocated memory is still 190.8MB. Free memory was 149.7MB in the beginning and 147.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4064.10ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 147.0MB in the beginning and 164.5MB in the end (delta: -17.5MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 773 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 773 mSDsluCounter, 686 SdHoareTripleChecker+Invalid, 0.5s 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-07 21:18:16,237 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...