/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:17:01,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:17:01,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:17:01,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:17:01,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:17:01,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:17:01,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:17:01,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:17:01,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:17:01,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:17:01,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:17:01,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:17:01,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:17:01,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:17:01,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:17:01,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:17:01,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:17:01,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:17:01,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:17:01,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:17:01,089 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:17:01,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:17:01,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:17:01,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:17:01,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:17:01,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:17:01,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:17:01,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:17:01,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:17:01,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:17:01,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:17:01,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:17:01,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:17:01,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:17:01,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:17:01,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:17:01,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:17:01,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:17:01,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:17:01,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:17:01,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:17:01,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:17:01,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:17:01,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:17:01,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:17:01,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:17:01,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:17:01,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:17:01,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:17:01,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:17:01,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:17:01,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:01,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:17:01,114 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:17:01,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:17:01,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:17:01,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:17:01,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:17:01,332 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:17:01,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-08 08:17:01,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d8700e9/748e978993464c7bb37a1160991e57de/FLAG3b88f8076 [2022-04-08 08:17:01,660 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:17:01,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-08 08:17:01,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d8700e9/748e978993464c7bb37a1160991e57de/FLAG3b88f8076 [2022-04-08 08:17:02,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d8700e9/748e978993464c7bb37a1160991e57de [2022-04-08 08:17:02,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:17:02,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:17:02,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:02,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:17:02,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:17:02,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abadced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02, skipping insertion in model container [2022-04-08 08:17:02,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:17:02,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:17:02,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-08 08:17:02,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:02,260 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:17:02,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-04-08 08:17:02,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:17:02,282 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:17:02,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02 WrapperNode [2022-04-08 08:17:02,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:17:02,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:17:02,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:17:02,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:17:02,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:17:02,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:17:02,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:17:02,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:17:02,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (1/1) ... [2022-04-08 08:17:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:17:02,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:02,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:17:02,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:17:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:17:02,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:17:02,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:17:02,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:17:02,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:17:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:17:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:17:02,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:17:02,400 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:17:02,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:17:02,557 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:17:02,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:17:02,563 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:17:02,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:02 BoogieIcfgContainer [2022-04-08 08:17:02,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:17:02,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:17:02,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:17:02,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:17:02,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:17:02" (1/3) ... [2022-04-08 08:17:02,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6f3a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:02, skipping insertion in model container [2022-04-08 08:17:02,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:17:02" (2/3) ... [2022-04-08 08:17:02,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6f3a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:17:02, skipping insertion in model container [2022-04-08 08:17:02,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:17:02" (3/3) ... [2022-04-08 08:17:02,583 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-08 08:17:02,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:17:02,587 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:17:02,613 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:17:02,617 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 08:17:02,617 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:17:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:17:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 08:17:02,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:02,634 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:02,634 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-08 08:17:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:02,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668162339] [2022-04-08 08:17:02,650 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:17:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-08 08:17:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:02,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054446592] [2022-04-08 08:17:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:02,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-08 08:17:02,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 08:17:02,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-08 08:17:02,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:02,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-08 08:17:02,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-08 08:17:02,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-08 08:17:02,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-08 08:17:02,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:02,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:02,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#(= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {55#false} is VALID [2022-04-08 08:17:02,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-08 08:17:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:02,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054446592] [2022-04-08 08:17:02,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054446592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:02,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:02,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:02,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668162339] [2022-04-08 08:17:02,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668162339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:02,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:02,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:17:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623186836] [2022-04-08 08:17:02,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:02,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 08:17:02,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:02,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:02,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:02,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:17:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:17:02,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:17:02,818 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:03,132 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-08 08:17:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:17:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-08 08:17:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 08:17:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-08 08:17:03,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-08 08:17:03,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:03,344 INFO L225 Difference]: With dead ends: 136 [2022-04-08 08:17:03,345 INFO L226 Difference]: Without dead ends: 83 [2022-04-08 08:17:03,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:17:03,349 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:03,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-08 08:17:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-08 08:17:03,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:03,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,375 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,376 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:03,380 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 08:17:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 08:17:03,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:03,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:03,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 08:17:03,381 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-08 08:17:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:03,384 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-08 08:17:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 08:17:03,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:03,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:03,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:03,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-08 08:17:03,389 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-08 08:17:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:03,389 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-08 08:17:03,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:03,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 125 transitions. [2022-04-08 08:17:03,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-08 08:17:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 08:17:03,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:03,478 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:03,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:17:03,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-08 08:17:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2144042035] [2022-04-08 08:17:03,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:03,692 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:03,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:17:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 162574473, now seen corresponding path program 1 times [2022-04-08 08:17:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078540239] [2022-04-08 08:17:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:03,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 08:17:03,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 08:17:03,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 08:17:03,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:03,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 08:17:03,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 08:17:03,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 08:17:03,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-08 08:17:03,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} is VALID [2022-04-08 08:17:03,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-08 08:17:03,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-08 08:17:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 08:17:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078540239] [2022-04-08 08:17:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078540239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452865209] [2022-04-08 08:17:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:03,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:03,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:03,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:17:03,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 08:17:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:03,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:17:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:03,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:17:03,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2022-04-08 08:17:03,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 08:17:03,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 08:17:03,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 08:17:03,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-08 08:17:03,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} is VALID [2022-04-08 08:17:03,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:03,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {704#(<= main_~blastFlag~0 1)} is VALID [2022-04-08 08:17:03,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(<= main_~blastFlag~0 1)} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= main_~blastFlag~0 1)} is VALID [2022-04-08 08:17:03,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {704#(<= main_~blastFlag~0 1)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-08 08:17:03,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-08 08:17:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:17:03,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:17:04,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-08 08:17:04,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(not (< 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-08 08:17:04,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:04,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:04,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:04,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:04,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:04,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-08 08:17:04,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-08 08:17:04,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 08:17:04,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 08:17:04,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2022-04-08 08:17:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:17:04,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452865209] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:04,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:17:04,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 7 [2022-04-08 08:17:04,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:04,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2144042035] [2022-04-08 08:17:04,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2144042035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:04,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:04,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:17:04,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026031121] [2022-04-08 08:17:04,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 08:17:04,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:04,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:04,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:17:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:17:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:17:04,214 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:04,564 INFO L93 Difference]: Finished difference Result 175 states and 273 transitions. [2022-04-08 08:17:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:17:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 08:17:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-04-08 08:17:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-04-08 08:17:04,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 213 transitions. [2022-04-08 08:17:04,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:04,710 INFO L225 Difference]: With dead ends: 175 [2022-04-08 08:17:04,710 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 08:17:04,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:17:04,712 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:04,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:17:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 08:17:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-08 08:17:04,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:04,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,753 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,753 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:04,757 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 08:17:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 08:17:04,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:04,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:04,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 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 98 states. [2022-04-08 08:17:04,765 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 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 98 states. [2022-04-08 08:17:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:04,770 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-08 08:17:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-08 08:17:04,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:04,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:04,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:04,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2022-04-08 08:17:04,781 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 14 [2022-04-08 08:17:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:04,781 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2022-04-08 08:17:04,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:04,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 142 transitions. [2022-04-08 08:17:04,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2022-04-08 08:17:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:17:04,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:04,883 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:04,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 08:17:05,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:05,086 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-08 08:17:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:05,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795603764] [2022-04-08 08:17:05,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,383 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:05,507 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:17:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 893692037, now seen corresponding path program 1 times [2022-04-08 08:17:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301443427] [2022-04-08 08:17:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:05,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:05,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-08 08:17:05,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-08 08:17:05,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-08 08:17:05,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:05,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-08 08:17:05,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-08 08:17:05,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-08 08:17:05,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-08 08:17:05,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#(= main_~blastFlag~0 0)} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(= main_~blastFlag~0 0)} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#(= main_~blastFlag~0 0)} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(= main_~blastFlag~0 0)} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:05,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:05,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [218] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-08 08:17:05,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-08 08:17:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 08:17:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:05,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301443427] [2022-04-08 08:17:05,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301443427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:05,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303635258] [2022-04-08 08:17:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:05,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:17:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 08:17:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:05,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 08:17:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:05,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:17:05,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-08 08:17:05,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-08 08:17:05,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-08 08:17:05,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-08 08:17:05,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-08 08:17:05,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#(= main_~blastFlag~0 0)} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(= main_~blastFlag~0 0)} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#(= main_~blastFlag~0 0)} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:05,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(= main_~blastFlag~0 0)} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1542#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1549#(or (and (= main_~s__state~0 8512) (= 2 main_~blastFlag~0) (= main_~s__hit~0 0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {1549#(or (and (= main_~s__state~0 8512) (= 2 main_~blastFlag~0) (= main_~s__hit~0 0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1549#(or (and (= main_~s__state~0 8512) (= 2 main_~blastFlag~0) (= main_~s__hit~0 0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:05,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1549#(or (and (= main_~s__state~0 8512) (= 2 main_~blastFlag~0) (= main_~s__hit~0 0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [218] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:05,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-08 08:17:05,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-08 08:17:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:17:05,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:17:06,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-08 08:17:06,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-08 08:17:06,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [218] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(not (< 2 main_~blastFlag~0))} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1568#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:06,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:06,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:06,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1599#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:06,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-08 08:17:06,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-08 08:17:06,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-08 08:17:06,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-08 08:17:06,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-08 08:17:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 08:17:06,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303635258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:17:06,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:17:06,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 11 [2022-04-08 08:17:06,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:06,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795603764] [2022-04-08 08:17:06,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795603764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:06,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:06,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:17:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961437369] [2022-04-08 08:17:06,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 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 35 [2022-04-08 08:17:06,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:06,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:06,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:06,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:17:06,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:06,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:17:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:17:06,276 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:06,994 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2022-04-08 08:17:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:17:06,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 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 35 [2022-04-08 08:17:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:17:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2022-04-08 08:17:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2022-04-08 08:17:06,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 214 transitions. [2022-04-08 08:17:07,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:07,149 INFO L225 Difference]: With dead ends: 197 [2022-04-08 08:17:07,149 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 08:17:07,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2022-04-08 08:17:07,151 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 208 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:17:07,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 90 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:17:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 08:17:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-08 08:17:07,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:17:07,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:07,181 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:07,181 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:07,184 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2022-04-08 08:17:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2022-04-08 08:17:07,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:07,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:07,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 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 110 states. [2022-04-08 08:17:07,185 INFO L87 Difference]: Start difference. First operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 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 110 states. [2022-04-08 08:17:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:17:07,187 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2022-04-08 08:17:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2022-04-08 08:17:07,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:17:07,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:17:07,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:17:07,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:17:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-04-08 08:17:07,190 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 35 [2022-04-08 08:17:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:17:07,190 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-04-08 08:17:07,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:07,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 155 transitions. [2022-04-08 08:17:07,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-04-08 08:17:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:17:07,303 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:07,303 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:17:07,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:17:07,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 08:17:07,504 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-08 08:17:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:07,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343855029] [2022-04-08 08:17:07,615 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,871 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 08:17:07,895 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 08:17:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 637718917, now seen corresponding path program 1 times [2022-04-08 08:17:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:17:07,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215723909] [2022-04-08 08:17:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:17:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:17:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:07,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {2484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-08 08:17:07,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 08:17:07,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2475#true} {2475#true} #200#return; {2475#true} is VALID [2022-04-08 08:17:07,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:17:07,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {2484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-08 08:17:07,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 08:17:07,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #200#return; {2475#true} is VALID [2022-04-08 08:17:07,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret9 := main(); {2475#true} is VALID [2022-04-08 08:17:07,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:07,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:07,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:07,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {2480#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2481#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:07,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2481#(= main_~blastFlag~0 0)} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2481#(= main_~blastFlag~0 0)} is VALID [2022-04-08 08:17:07,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {2481#(= main_~blastFlag~0 0)} [224] L188-->L35_primed: Formula: (let ((.cse1 (= 8466 v_main_~s__state~0_107)) (.cse0 (= v_main_~blastFlag~0_84 0)) (.cse2 (= v_main_~s__state~0_107 v_main_~s__state~0_106)) (.cse3 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83))) (or (and (= 8496 v_main_~s__state~0_106) .cse0 (= v_main_~blastFlag~0_83 1) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0))) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:07,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:07,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [226] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_107 v_main_~s__state~0_106) (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:07,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-08 08:17:07,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [228] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__hit~0_13 0)) (.cse0 (= 8496 v_main_~s__state~0_109)) (.cse1 (= v_main_~blastFlag~0_86 1)) (.cse3 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse4 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and (= 2 v_main_~blastFlag~0_85) .cse0 .cse1 (= v_main_~s__state~0_108 8656) (not .cse2)) (and (or .cse2 (not .cse0) (not .cse1)) .cse3 .cse4) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse3 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:07,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:07,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [230] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:07,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:07,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2476#false} is VALID [2022-04-08 08:17:07,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-08 08:17:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 08:17:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:17:07,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215723909] [2022-04-08 08:17:07,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215723909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:17:07,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360707051] [2022-04-08 08:17:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:17:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:17:08,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:17:08,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 08:17:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 08:17:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:17:08,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:17:08,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-08 08:17:08,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-08 08:17:08,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 08:17:08,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #200#return; {2475#true} is VALID [2022-04-08 08:17:08,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret9 := main(); {2475#true} is VALID [2022-04-08 08:17:08,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {2503#(and (<= main_~s__state~0 8466) (<= main_~blastFlag~0 0))} [224] L188-->L35_primed: Formula: (let ((.cse1 (= 8466 v_main_~s__state~0_107)) (.cse0 (= v_main_~blastFlag~0_84 0)) (.cse2 (= v_main_~s__state~0_107 v_main_~s__state~0_106)) (.cse3 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83))) (or (and (= 8496 v_main_~s__state~0_106) .cse0 (= v_main_~blastFlag~0_83 1) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0))) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} [226] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_107 v_main_~s__state~0_106) (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {2519#(or (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} [228] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__hit~0_13 0)) (.cse0 (= 8496 v_main_~s__state~0_109)) (.cse1 (= v_main_~blastFlag~0_86 1)) (.cse3 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse4 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and (= 2 v_main_~blastFlag~0_85) .cse0 .cse1 (= v_main_~s__state~0_108 8656) (not .cse2)) (and (or .cse2 (not .cse0) (not .cse1)) .cse3 .cse4) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse3 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2532#(or (= main_~blastFlag~0 1) (and (= 8656 main_~s__state~0) (not (= main_~s__hit~0 0)) (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#(or (= main_~blastFlag~0 1) (and (= 8656 main_~s__state~0) (not (= main_~s__hit~0 0)) (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 0))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2532#(or (= main_~blastFlag~0 1) (and (= 8656 main_~s__state~0) (not (= main_~s__hit~0 0)) (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {2532#(or (= main_~blastFlag~0 1) (and (= 8656 main_~s__state~0) (not (= main_~s__hit~0 0)) (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 0))} [230] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2539#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {2539#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2539#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} is VALID [2022-04-08 08:17:08,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 1) (<= main_~blastFlag~0 0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2476#false} is VALID [2022-04-08 08:17:08,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-08 08:17:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 08:17:08,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:17:08,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-08 08:17:08,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2476#false} is VALID [2022-04-08 08:17:08,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-08 08:17:08,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [230] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-08 08:17:08,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-08 08:17:08,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [228] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__hit~0_13 0)) (.cse0 (= 8496 v_main_~s__state~0_109)) (.cse1 (= v_main_~blastFlag~0_86 1)) (.cse3 (= v_main_~s__state~0_109 v_main_~s__state~0_108)) (.cse4 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and (= 2 v_main_~blastFlag~0_85) .cse0 .cse1 (= v_main_~s__state~0_108 8656) (not .cse2)) (and (or .cse2 (not .cse0) (not .cse1)) .cse3 .cse4) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse3 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_109, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2552#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-08 08:17:08,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [226] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_107 v_main_~s__state~0_106) (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [224] L188-->L35_primed: Formula: (let ((.cse1 (= 8466 v_main_~s__state~0_107)) (.cse0 (= v_main_~blastFlag~0_84 0)) (.cse2 (= v_main_~s__state~0_107 v_main_~s__state~0_106)) (.cse3 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83))) (or (and (= 8496 v_main_~s__state~0_106) .cse0 (= v_main_~blastFlag~0_83 1) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0))) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_107} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_106} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2565#(not (< 2 main_~blastFlag~0))} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2565#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-08 08:17:08,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:08,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_105 v_main_~s__state~0_104)) (.cse3 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81)) (.cse1 (= v_main_~s__state~0_105 8656)) (.cse0 (= 2 v_main_~blastFlag~0_82))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse2 .cse3) (and (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_104 8672) .cse1 .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_105} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_104} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:08,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2584#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-08 08:17:08,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret9 := main(); {2475#true} is VALID [2022-04-08 08:17:08,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #200#return; {2475#true} is VALID [2022-04-08 08:17:08,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 08:17:08,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-08 08:17:08,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-08 08:17:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 08:17:08,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360707051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:17:08,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 08:17:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2022-04-08 08:17:08,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:17:08,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343855029] [2022-04-08 08:17:08,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343855029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:17:08,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:17:08,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:17:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166796374] [2022-04-08 08:17:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:17:08,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 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 35 [2022-04-08 08:17:08,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:17:08,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:17:08,895 WARN L143 InductivityCheck]: Transition 2615#(and (= 3 main_~blastFlag~0) (= main_~s__state~0 8672) (not (= main_~s__hit~0 0))) ( _ , assume !false; , 2483#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0)) ) not inductive [2022-04-08 08:17:08,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 08:17:09,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:17:09,108 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:17:09,119 INFO L158 Benchmark]: Toolchain (without parser) took 7018.84ms. Allocated memory was 186.6MB in the beginning and 251.7MB in the end (delta: 65.0MB). Free memory was 139.6MB in the beginning and 136.3MB in the end (delta: 3.2MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. [2022-04-08 08:17:09,119 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 156.3MB in the beginning and 156.2MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:17:09,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.18ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 164.0MB in the end (delta: -24.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-08 08:17:09,119 INFO L158 Benchmark]: Boogie Preprocessor took 21.15ms. Allocated memory is still 186.6MB. Free memory was 164.0MB in the beginning and 162.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:17:09,120 INFO L158 Benchmark]: RCFGBuilder took 260.79ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 148.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 08:17:09,120 INFO L158 Benchmark]: TraceAbstraction took 6550.43ms. Allocated memory was 186.6MB in the beginning and 251.7MB in the end (delta: 65.0MB). Free memory was 147.6MB in the beginning and 136.3MB in the end (delta: 11.3MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-04-08 08:17:09,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 156.3MB in the beginning and 156.2MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.18ms. Allocated memory is still 186.6MB. Free memory was 139.4MB in the beginning and 164.0MB in the end (delta: -24.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.15ms. Allocated memory is still 186.6MB. Free memory was 164.0MB in the beginning and 162.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 260.79ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 148.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6550.43ms. Allocated memory was 186.6MB in the beginning and 251.7MB in the end (delta: 65.0MB). Free memory was 147.6MB in the beginning and 136.3MB in the end (delta: 11.3MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:17:09,157 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...